# oj t -c "python3 main.py" import sys,math from collections import defaultdict,deque from itertools import combinations,permutations,accumulate,product from bisect import bisect_left,bisect_right from heapq import heappop,heappush,heapify #from more_itertools import distinct_permutations,distinct_combinations #from sortedcontainers import SortedList,SortedSet def input():return sys.stdin.readline().rstrip() def ii(): return int(input()) def ms(): return map(int, input().split()) def li(): return list(map(int,input().split())) inf = pow(10,18) mod = 998244353 #///////////////////////////////// # 切り上げ除算 def celiDiv(p : int, q : int) -> int: return (p + q -1) // q N,S,B = ms() H = li() tmp = H[0] now = S for i in range(N-1): if tmp-H[i]<S-now: tmp = H[i]; now = S if tmp<H[i+1]: if now<celiDiv(H[i+1]-tmp,B): print('No') exit() aa = celiDiv(H[i+1]-tmp,B) tmp += B*aa now -= aa print('Yes')