#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    ll n, x, m;
    cin >> n >> x >> m;

    vector<ll> a(n);
    rep(i, n) cin >> a[i];

    ll cnt = 0;
    ll now_mp = 0;
    for(ll i=n-1; i>=0; i--){
        rep(j, cnt) a[i] /= 2;
        while(a[i] > x){
            cnt++;
            now_mp += i+1;
            a[i]/=2;
            if(now_mp > m){
                cout << "No" << endl;
                return 0;
            }
        }
    }

    cout << "Yes" << endl;
}