#include <iostream>
#include <cstdint>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	uint32_t N, S, B, i;
	cin >> N >> S >> B;
	vector<uint32_t> H(N);
	for (i = 0; i != N; ++i)
		cin >> H[i];

	if (N == 1)
	{
		cout << "Yes\n";
		return 0;
	}

	sort(H.begin() + 1, H.end() - 1);

	i = lower_bound(H.begin() + 1, H.end() - 1, H[0]) - H.begin();
	if (H[0] + S * static_cast<uint64_t>(B) < H[i])
	{
		cout << "No\n";
		return 0;
	}

	for (++i; i < N; ++i)
		if (H[i - 1] + S * static_cast<uint64_t>(B) < H[i])
		{
			cout << "No\n";
			return 0;
		}

	cout << "Yes\n";
	return 0;
}