#include <cctype>
#include <string>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <chrono>
using namespace std;
using ll = long long;
using pii = pair<int,int>;using pll = pair<ll,ll>;using pci = pair<char,int>;
using vi = vector<int>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;using vc = vector<char>;
using vpii = vector<pii>;using vpll = vector<pll>;using vpci = vector<pci>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvb = vector<vb>;
using mpii = map<int,int>;using mpll = map<ll,ll>;
using mpib = map<int,bool>;using mpil = map<int,ll>;
using mpci = map<char,int>;using mpsi = map<string,int>;
using mpivi = map<int,vector<int>>;using mpivl = map<int,vector<ll>>;
using mplvl = map<ll,vl>;
using mpisi = map<int,set<int>>;using mpisl = map<int,set<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YesNo(flag) if(flag){printf("Yes\n");}else{printf("No\n");}
#define OUT(x) {cout << x << '\n';}
#define OUT_(x) {cout << x << ' ';}
#define all(x) (x).begin(),(x).end()
inline void scan(){}
template<class Head,class... Tail>
inline void scan(Head&head,Tail&... tail){std::cin>>head;scan(tail...);}
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) long long __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline T ifloor(T x, T y){return x/y-(x%y ? (x < 0)^(y < 0) : 0);}
template<class T> inline T iceil(T x, T y){return x/y+(x%y ? (x >= 0)^(y < 0) : 0);}
int iinf = 1000000000;
ll linf = 1000000000000000000LL;

mt19937 mt;
int main(){
    LL(n,s,b);
    vl H(n);rep(i,n)scan(H[i]);
    vl dp(s + 1,-1);
    dp[s] = H[0];
    for(int i = 1;i < n;i++){
        int h = H[i];
        vl ndp(s + 1,-1);
        for(int j = 0;j <= s;j++){
            if(dp[j] == -1) continue;
            ll nowh = dp[j];
            if(nowh >= h){
                chmax(ndp[j],nowh);
            }else if(iceil(h - nowh,b) <= j){
                chmax(ndp[j - iceil(h - nowh,b)],nowh + b * iceil(h - nowh,b));
            }
        }
        swap(dp,ndp);
        bool flg = 0;
        rep(i,s + 1)flg |= dp[i] != -1;
        if(flg)chmax(dp[s],H[i]);
    }
    bool flg = 0;
    rep(i,s + 1)flg |= dp[i] != -1;
    YesNo(flg);
}