A loading dock has n crates in a line; crate i has a positive integer weight. You may select any subset of the crates (possibly none) to load onto a cart. Determine whether some subset's weights sum to EXACTLY a target capacity T.
Input format
Line 1: two integers n T.
Line 2: n space-separated positive integers, the crate weights (empty if n = 0).
Output format
Print YES if some subset of the crates sums to exactly T, otherwise print NO. (The empty subset sums to 0, so if T = 0 the answer is always YES.)
Constraints
- 0 ≤ n ≤ 40
- 0 ≤ T ≤ 2000
- 1 ≤ each weight ≤ 200