N,S,B = map(int,input().split())
H = list(map(int,input().split()))

dp = {S:H[0]}
for i in range(1,N):
    ndp = {}
    for s,h in dp.items():
        need = max(0,H[i]-h)
        k = 0--need//B
        if k > s: continue
        ns = s-k
        nh = h + k*B
        if ns in ndp:
            ndp[ns] = max(ndp[ns],nh)
        else:
            ndp[ns] = nh
        if S in ndp:
            ndp[S] = max(ndp[S],H[i])
        else:
            ndp[S] = H[i]
    dp = ndp

print('Yes' if dp else 'No')