#include <bits/stdc++.h>
//#include <atcoder/modint>

using namespace std;
//using namespace atcoder;
using ll = long long;
//using mint = modint998244353;

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

    ll N, X, M, A, ans=0;
    cin >> N >> X >> M;
    vector<ll> c(N);
    
    for (int i=0; i<N; i++){
        cin >> A;
        while(A > X){
            A /= 2;
            c[i]++;
        }
    }
    for (int i=N-2; i>=0; i--) c[i] = max(c[i], c[i+1]);
    c.push_back(0);
    for (int i=N-1; i>=0; i--){
        ans += (c[i]-c[i+1]) * (i+1);
    }
    if (ans <= M) cout << "Yes" << endl;
    else cout << "No" << endl;

    return 0;
}