#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
#include <cmath>
#include <bitset>
#include <fstream>
using namespace std;

int main() {
    int n,x,m;
    cin >> n >> x >> m;
    vector<int> a(n);
    for(int i=0;i<n;i++) cin >> a[i];
    while(m){
        for(int i=n-1;0<=i;i--){
            if(x<=a[i]){
                for(int j=i;0<=j;j--){
                    a[j]/=2;
                }
                m-=i+1;
                break;
            }
        }
        if(m<0) break;
        bool flag = true;
        for(int i=0;i<n;i++){
            if(x<=a[i]) flag = false;
        }
        if(flag) {
            cout << "Yes" << endl;
            return 0;
        }
    }
    
    if(0<=m){
        bool flag = true;
        for(int i=0;i<n;i++){
            if(x<=a[i]) flag = false;
        }
        if(flag) {
            cout << "Yes" << endl;
            return 0;
        }
    }
    
    cout << "No" << endl;
}