AT_abc429_b [ABC429B] N - 1

You are given an integer sequence of length $ N $ , $ A=(A_1,A_2,\ldots,A_N) $ , and an integer $ M $ . Determine whether it is possible to remove one of the $ N $ elements of $ A $ so that the sum of the remaining $ (N-1) $ elements is exactly $ M $ .

The input is given from Standard Input in the following format: > $ N $ $ M $ $ A_1 $ $ A_2 $ $ \ldots $ $ A_N $

If it is possible to remove one of the $ N $ elements of $ A $ so that the sum of the remaining $ (N-1) $ elements is exactly $ M $ , print `Yes`; otherwise, print `No`.

### Sample Explanation 1 If you choose $ A_1,A_3,A_4 $ , the sum is $ 3+3+4=10 $ . Therefore, print `Yes`. ### Sample Explanation 2 No matter how you choose four elements, their sum is not equal to $ 16 $ . Therefore, print `No`. ### Constraints - $ 2\le N\le 100 $ - $ 0\le M\le 10000 $ - $ 0\le A_i\le 100 $ - All input values are integers.