#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001

int main() {
	
	int N;
	long long X,M;
	cin>>N>>X>>M;
	
	vector<long long> need(N);
	rep(i,N){
		long long a;
		cin>>a;
		while(a >= X){
			a/=2;
			need[i] ++;
		}
	}
	for(int i=N-2;i>=0;i--)need[i] = max(need[i],need[i+1]);
	rep(i,N){
		M -= need[i];
	}
	if(M<0)cout<<"No"<<endl;
	else cout<<"Yes"<<endl;
	
    return 0;
}