AT_awc0004_a 出発までの準備

Takahashi is preparing so that he won't be late for a meeting with his friend. Takahashi needs to finish several preparation tasks before leaving. To make it to the meeting on time, he must leave his house by $ T $ o'clock $ 0 $ minutes at the latest. Takahashi has $ N $ preparation tasks, and the $ i $ -th task takes $ A_i $ minutes to complete. Takahashi starts preparing at $ S $ o'clock $ 0 $ minutes on the same day, and performs each of the $ N $ tasks exactly once, consecutively without any breaks. The total time for all tasks is $ A_1 + A_2 + \cdots + A_N $ minutes. If he finishes all preparations at or before $ T $ o'clock $ 0 $ minutes, Takahashi can leave in time for the meeting. Determine whether Takahashi can finish all preparations and leave by $ T $ o'clock $ 0 $ minutes.

> $ N $ $ S $ $ T $ $ A_1 $ $ A_2 $ $ \ldots $ $ A_N $ - The first line contains three space-separated integers: $ N $ , the number of preparation tasks; $ S $ , the hour at which preparation starts; and $ T $ , the hour of the departure deadline. - The second line contains space-separated integers $ A_1, A_2, \ldots, A_N $ , representing the time (in minutes) each task takes.

If Takahashi can finish all preparations and leave by $ T $ o'clock $ 0 $ minutes, print `Yes`; otherwise, print `No`.

### Constraints - $ 1 \leq N \leq 100 $ - $ 0 \leq S \leq 23 $ - $ 0 \leq T \leq 23 $ - $ S \leq T $ - $ 1 \leq A_i \leq 60 $ $ (1 \leq i \leq N) $ - All inputs are integers