#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, s, b; cin >> n >> s >> b;
	vector<int>h(n);
	rep(i, n)cin >> h[i];
	vector<long long>dp(s + 1, -1);
	dp[s] = h[0];
	rep(i, n - 1) {
		vector<long long>ndp(s + 1, -1);
		rep(j, s + 1) {
			if (-1 == dp[j])continue;
			long long d = h[i + 1] - dp[j];
			if (d > 0)d = (d + b - 1) / b;
			else d = 0;
			if (j < d)continue;
			long long val = dp[j] + d * b;
			chmax(ndp[j - d], val);
		}
		rep(j, s)if (-1 != ndp[j])chmax(ndp[s], h[i + 1]);
		swap(dp, ndp);

	}
	bool chk = false;
	rep(i, s + 1)if (-1 != dp[i])chk = true;
	cout << (chk ? "Yes" : "No") << endl;
	return 0;
}