#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n+1); i++)
#define repn(i,a,b) for (int i = (int)(a) ; i < (int)(b+1); i++)
#define repv(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) ((int)(x).size())
#define cauto const auto&
#define bit(n) (1LL<<(n))
#define uni(v) v.erase( unique(v.begin(), v.end()), v.end() );
using ll = long long;
using P = pair<int,int>;
using PP = pair<int, P>;
using Graph = vector<vector<int>>;
#ifdef LOCAL
    #include <debug.hpp>
    #define debug(...) debug::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
    #define debug(...) (static_cast<void>(0))
#endif

int main(){
    ll n,x,m;
    cin >> n >> x >> m;
    vector<ll> a(n);
    rep(i,n){
        cin >> a[i];
    }
    vector<ll> attacks;
    attacks.push_back(x-1);
    rep(i,m){
        if(attacks[i] <= 1e9){
            attacks.push_back(attacks[i]*2+1);
        }
        else{
            attacks.push_back(1e18);
            break;
        }
    }
    debug(attacks);
    int kaisuu = 0;
    int now_kaisuu_max = distance(attacks.begin(),lower_bound(all(attacks),a[0]));
    rep(i,n){
        int now_kaisuu = distance(attacks.begin(),lower_bound(all(attacks),a[i]));
        kaisuu += distance(attacks.begin(),lower_bound(all(attacks),a[i]));
        if(now_kaisuu_max <= now_kaisuu){
            now_kaisuu_max = now_kaisuu;
            kaisuu = now_kaisuu_max*(i+1);
        }
    }
    debug(kaisuu);
    cout << (kaisuu <= m ? "Yes" : "No") << endl;
    return 0;
}