Tianjin University Online Judge
Contests Virtual Contests Problems Submit Runs Status Rank List Forum

2231.   Super A+B Problem
Time Limit: 2.0 Seconds   Memory Limit: 65536K
Total Runs: 3520   Accepted Runs: 1122

The A+B Problem seems a little easy, now we turn to an enhanced version...

Given a series of numbers, your task is to pick up some numbers, so that the sum of these numbers is a given S.


The first line of each test contains the amount of the numbers N (1 ≤ N ≤ 20), and the sum S. Then N integers followed in the second line seperated by spaces. You can assume the sum S and all the N numbers are in the range [-10000, 10000].

The input is terminated by a line with N = S = 0.


Output one line for each test case. If you can pick up some numbers whose sum is S, just output "Yes". Otherwise, output "No".

Sample Input

3 4
1 2 3
4 10
1 2 3 -4
0 0

Sample Output


Author: RoBa

Source: TOJ 2006 Weekly Contest 6
Submit   List    Runs   Forum   Statistics

Tianjin University Online Judge v1.3.0
Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz