AT_abc408_a [ABC408A] Timeout

The elder of Takahashi Village falls asleep immediately. Specifically, if $ S+0.5 $ seconds or more have passed since the elder was last tapped on the shoulder, the elder falls asleep. Currently, the elder is awake, and an attendant has just tapped the elder on the shoulder. From now on, the attendant will tap the elder's shoulder exactly $ N $ times. The $ i $ -th shoulder tap will be performed $ T_i $ seconds from now. Determine whether the elder remains awake continuously from now until $ T_N $ seconds later.

The input is given from Standard Input in the following format: > $ N $ $ S $ $ T_1 $ $ T_2 $ $ \ldots $ $ T_N $

If the elder remains awake continuously from now until $ T_N $ seconds later, output `Yes`; otherwise, output `No`.

### Sample Explanation 1 The attendant taps the shoulder in chronological order as follows: - Taps after $ 6 $ seconds. At this time, only $ 6 $ seconds have passed since the elder was last tapped on the shoulder, so the elder is awake. - Taps after $ 11 $ seconds. At this time, only $ 5 $ seconds have passed since the elder was last tapped on the shoulder, so the elder is awake. - Taps after $ 21 $ seconds. At this time, only $ 10 $ seconds have passed since the elder was last tapped on the shoulder, so the elder is awake. - Taps after $ 22 $ seconds. At this time, only $ 1 $ second has passed since the elder was last tapped on the shoulder, so the elder is awake. - Taps after $ 30 $ seconds. At this time, only $ 8 $ seconds have passed since the elder was last tapped on the shoulder, so the elder is awake. Since the elder is awake from now until $ 30 $ seconds later, output `Yes`. ### Sample Explanation 2 The elder falls asleep $ 101.5 $ seconds from now. Therefore, output `No`. ### Constraints - $ 1 \leq N \leq 100 $ - $ 1 \leq S \leq 100 $ - $ 1 \leq T_i \leq 1000 $ ( $ 1 \leq i \leq N $ ) - $ T_i < T_{i+1} $ ( $ 1 \leq i \leq N-1 $ ) - All input values are integers.