A one-dimensional Japanese crossword can be represented as a binary string of length *x*. An encoding of this crossword is an array *a* of size *n*, where *n* is the number of segments formed completely of 1's, and *a*<sub class="lower-index">*i*</sub> is the length of *i*-th segment. No two segments touch or intersect.

For example: 
 -  If *x* = 6 and the crossword is 111011, then its encoding is an array {3, 2}; -  If *x* = 8 and the crossword is 01101010, then its encoding is an array {2, 1, 1}; -  If *x* = 5 and the crossword is 11111, then its encoding is an array {5}; -  If *x* = 5 and the crossword is 00000, then its encoding is an empty array. 
Mishka wants to create a new one-dimensional Japanese crossword. He has already picked the length and the encoding for this crossword. And now he needs to check if there is exactly one crossword such that its length and encoding are equal to the length and encoding he picked. Help him to check it!
The first line contains two integer numbers *n* and *x* (1 ≤ *n* ≤ 100000, 1 ≤ *x* ≤ 10<sup class="upper-index">9</sup>) — the number of elements in the encoding and the length of the crossword Mishka picked.

The second line contains *n* integer numbers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10000) — the encoding.
none
2 4
1 3
NO
3 10
3 3 2
YES
2 10
1 3
NO
1 1
1
YES
1 10
10
YES
1 10000
10000
YES
10 1
5 78 3 87 4 9 5 8 9 1235
NO
3 12
3 3 3
NO
3 9
2 2 2
NO
2 5
1 1
NO
1 2
1
NO
3 13
3 3 3
NO
3 6
1 1 1
NO
1 6
5
NO
3 11
3 3 2
NO
2 6
1 3
NO
3 10
2 2 2
NO
3 8
2 1 1
NO
1 5
2
NO
1 3
1
NO
5 5
1 1 1 1 1
NO
2 10
4 4
NO
2 8
2 3
NO
2 4
1 1
NO
3 10
1 2 4
NO
3 10
2 1 3
NO
2 6
1 2
NO
3 4
1 1 1
NO
3 11
1 2 4
NO
3 12
3 3 2
NO
4 9
1 1 1 1
NO
1 10
9
NO
1 7
5
NO
2 5
1 2
NO
3 8
1 1 2
NO
3 7
1 1 1
NO
1 10
1
NO
3 10
2 3 4
NO
3 9
1 2 3
NO
3 9
3 3 2
NO
3 6
3 3 2
NO
1 1
3
NO
1 3
2
NO
3 10
3 3 3
NO
3 5
1 1 1
YES
2 1
100 100
NO
3 3
3 3 3
NO
4 17
3 3 9 1
NO
4 1660
1505 13 37 100
NO
3 5
3 3 2
NO
4 10
3 3 2 5
NO
5 5
5 5 5 5 5
NO
1 1
2
NO
5 10
1 2 2 4 5
NO
2 1
1 1
NO
n, x = map(int, input().split())
l = list(map(int, input().split()))
if sum(l) + len(l) - 1 > x:
	print('No')
elif sum(l) + len(l) - 1 < x:
	print('No')
else:
	print('Yes') 