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

#include<atcoder/modint>
using namespace atcoder;
using mint=modint998244353;

void solve(){
    ll N,S,B;
    cin>>N>>S>>B;
    ll H;
    cin>>H;
    ll X=H+S*B;
    for(int i=1;i<N;i++){
        cin>>H;
        if(X<H){
            cout<<"No"<<endl;
            return;
        }
        X=max(X,H+S*B);
    }
    cout<<"Yes"<<endl;
}

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

    
    // ll T;
    // cin>>T;
    // while(T--)
    solve();
}