An apothecary keeps n vials, each holding a whole number of millilitres. To fill a prescription you may pour out the full contents of any chosen subset of the vials (you never pour part of a vial). Selecting no vial at all yields a total of 0. Decide whether some subset of vials has contents that add up to exactly the required volume T.
Input format
Line 1: two integers n and T.
Line 2: n space-separated integers, the vial volumes.
Output format
Print YES if some subset of the vials sums to exactly T, otherwise NO.
Constraints
- 1 <= n <= 40
- 1 <= each volume <= 1000
- 0 <= T <= 40000