AT_abc413_a [ABC413A] Content Too Large

Takahashi has $ N $ items and one bag. The size of the $ i $ -th $ (1\le i\le N) $ item is $ A_i $ , and the size of the bag is $ M $ . If and only if the total size of the items he is trying to put in the bag is at most $ M $ , he can put all those items in the bag simultaneously. If he can put all $ N $ items in the bag simultaneously, print `Yes`; otherwise, print `No`.

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

If Takahashi can put all items in the bag simultaneously, print `Yes`; otherwise, print `No`.

### Sample Explanation 1 The total size of the $ 5 $ items is $ 3+1+4+1+5=14 $ . Since this is not greater than the bag size $ 15 $ , Takahashi can put all items in the bag simultaneously. Thus, print `Yes`. ### Sample Explanation 2 The total size of the $ 5 $ items is $ 14 $ , which is greater than the bag size $ 5 $ , so he cannot put all items in the bag simultaneously. Thus, print `No`. ### Constraints - $ 1\le N\le100 $ - $ 1\le M\le10000 $ - $ 1\le A_i\le100\ (1\le i\le N) $ - All input values are integers.