Problem2289--Can you buy them all?

2289: Can you buy them all?

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

Description

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 200200 points

Problem Statement

Takahashi's shop sells NN products. The usual price of the ii-th product is A_iAi yen (Japanese currency).
It has a bargain sale today, with a discount of 11 yen off the usual prices for the 22-nd, 44-th, and the subsequent even-indexed products. The 11-st, 33-rd, and the subsequent odd-indexed products are sold for their usual prices.
You have XX yen. Can you buy all the NN products with this money?

Constraints

  • 1 \leq N \leq 1001N100
  • 1 \leq X \leq 100001X10000
  • 1 \leq A_i \leq 1001Ai100
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:
NNXXA_1A1A_2A2\ldotsA_NAN

Output

If you can buy all the NN products, print Yes; otherwise, print No.

Sample Input Copy

2 3
1 3

Sample Output Copy

Yes

HINT

You can buy the 11-st product for 11 yen and the 22-nd product for 22 yen, 11 yen off the usual price. You have just enough money, 33 yen, to buy both of them.

Source/Category