CF426A.Sereja and Mugs

Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and n water mugs on it. Then all players take turns to move. During a move, a player takes a non-empty mug of water and pours all water from it into the cup. If the cup overfills, then we assume that this player lost.

As soon as Sereja's friends heard of the game, they wanted to play it. Sereja, on the other hand, wanted to find out whether his friends can play the game in such a way that there are no losers. You are given the volumes of all mugs and the cup. Also, you know that Sereja has (n - 1) friends. Determine if Sereja's friends can play the game so that nobody loses.

谢列亚向他的朋友们展示了一个有趣的游戏。游戏规则如下：初始时，桌子上有一个空杯子和 $n$ 个装有水的水杯。随后所有玩家轮流进行操作。每次操作中，一名玩家选择一个非空的水杯，并将其内全部的水倒入杯子中。如果此时杯子溢出，则该玩家判负。

谢列亚的朋友们一听说这个游戏，便想马上开始玩。而谢列亚则想知道：他的朋友们能否以某种方式玩游戏，使得无人失败。现给出所有水杯以及杯子的容量。此外，已知谢列亚有 $(n-1)$ 个朋友。请判断：谢列亚的朋友们能否以某种顺序进行操作，使得无人失败。

The first line contains integers n and s (2 ≤ n ≤ 100; 1 ≤ s ≤ 1000) — the number of mugs and the volume of the cup. The next line contains n integers _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 10). Number a__i means the volume of the i-th mug.

第一行包含两个整数 $n$ 和 $s$（$2 \le n \le 100$；$1 \le s \le 1000$）—— 分别表示水杯的数量和杯子的容量。
下一行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 10$）。其中 $a_i$ 表示第 $i$ 个水杯的容量。

In a single line, print "YES" (without the quotes) if his friends can play in the described manner, and "NO" (without the quotes) otherwise.

在一行中，如果他的朋友们能以所描述的方式进行游戏，则输出 "YES"（不带引号），否则输出 "NO"（不带引号）。