#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for( ll i = 0; i < n; i++ )
using ll = long long;

int main() {
	int N, s, b;
	cin >> N >> s >> b;
	vector<int> h(N);
	rep(i, N) cin >> h[i];
	vector<vector<int>> dp(N, vector<int>(2));
	dp[0][0] = s;
	dp[0][1] = h[0];
	rep(i, N - 1) {
		if(h[i + 1] <= dp[i][1]) {
			dp[i + 1][0] = dp[i][0];
			dp[i + 1][1] = dp[i][1];
		}
		else {
			int d = max(0, h[i + 1] - dp[i][1]);
			int c = 0;
			if(d) c = (d + b - 1) / b;
			if(dp[i][0] < c) break;
			dp[i + 1][0] = s;
			dp[i + 1][1] = h[i + 1];
		}
	}
	string ans = "No";
	if(dp[N - 1][0]) ans = "Yes";
	cout << ans << endl;
}