#include <iostream>
#include <vector>
#include <map>

using namespace std;
using ll = long long;


int main(){
  int n, s;
  ll b;
  cin >> n >> s >> b;
  vector<ll> h(n);
  for (ll &i: h) cin >> i;
  ll now = h[0];
  ll st = s;
  for (int i = 0; i < n - 1; i++){
    if (now >= h[i + 1]) continue;
    ll diff = h[i + 1] - now;
    ll need = (diff + b - 1) / b;
    if (need > st){
      cout << "No" << endl;
      return 0;
    }
    st = s;
    now = h[i + 1];
  }
  cout << "Yes" << endl;
}