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

#define debug(x) cerr << #x << " = " << (x) << endl
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

struct IOSetup
{
	IOSetup()
	{
		cin.tie(nullptr)->sync_with_stdio(false);
		cout << fixed << setprecision(16);
		cerr << fixed << setprecision(16);
	}
} iosetup;

template <typename T1, typename T2>
ostream &operator <<(ostream &os, const pair<T1, T2> &p)
{
	os << p.first << " " << p.second;
	return os;
}

template <typename T1, typename T2>
istream &operator >>(istream &is, pair<T1, T2> &p)
{
	is >> p.first >> p.second;
	return is;
}

template <typename T>
ostream &operator <<(ostream &os, const vector<T> &v)
{
	for(int i = 0; i < (int) v.size(); i++) os << v[i] << (i+1 == (int) v.size() ? "" : " ");
	return os;
}

template <typename T>
istream &operator >>(istream &is, vector<T> &v)
{
	for(int i = 0; i < (int) v.size(); i++) is >> v[i];
	return is;
}

template <typename T> bool chmax(T &a, const T &b) { if(a < b) { a = b; return true; } return false; }
template <typename T> bool chmin(T &a, const T &b) { if(a > b) { a = b; return true; } return false; }

////////////////////////////////////////////////////////

int main()
{
	int N, S, B; cin >> N >> S >> B;
	vector<int> H(N); cin >> H;
	int now = H[0], hp = S;
	for(int i = 0; i+1 < N; i++)
	{
		if(now < H[i+1])
		{
			int need = (H[i+1]-now+B-1)/B;
			if(hp < need)
			{
				cout << "No" << endl;
				return 0;
			}
			now = H[i+1];
			hp = S;
		}
	}
	return 0;
}