#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
using V=vector<ll>;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)

int main(){
    ll n,x,m;
    cin >> n >> x >> m;
    V a(n);
    set<P> s;
    rep(i,n){
        cin >> a[i];
        s.insert(P(a[i],i));
    }

    while(m){
        auto i=s.end(); --i;
        int k=min(m,(*i).second+1);
        rep(j,k){
            s.erase(P(a[j],j));
            a[j]/=2;
            s.insert(P(a[j],j));
        }
        m-=k;
    }

    ll M=0;
    rep(i,n) M=max(M,a[i]);
    if(x<M) cout << "No" << endl;
    else cout << "Yes" << endl;

}