#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))z
using namespace std;
using namespace atcoder;
using ll = long long;
const ll mod = 998244353;
using mint = modint998244353;
using Graph = vector<vector<pair<int,ll>>>;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};

double dist(int x1, int y1, int x2, int y2){
  double res = (x1-x2) * (x1-x2) + (y1-y2) * (y1-y2);
  return sqrt(res);
}

ll need(ll n, ll m){
  ll res = 0;
  if(n < 0) return res;
  res = n / m;
  if(n % m > 0) res++;
  return res;
}

int main(){
  // input
  int N; ll S,B;
  cin >> N >> S >> B;
  vector<ll> H(N);
  for(int i = 0; i < N; i++) cin >> H[i];
  
  // solve
  bool can = 1;
  ll hp = S, now = H[0];
  for(int i = 1; i + 1 < N; i++){
    if(now - H[i] <= (S - hp) * B){// chakuchi or not
      now = H[i];
      hp = S;
    }
    
    if(now >= H[i+1]) continue;
    else if(now + B * hp >= H[i+1]){
      ll use_hp = need(H[i+1] - now,B);
      now += B * use_hp;
      hp -= use_hp;
    }
    else can = 0;
    
    if(!can) break;
  }
  
  cout << (can ? "Yes" : "No") << endl;
}