#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<math.h>
#include<set>
#define all(x) x.begin(),x.end()
#define gall(x) x.begin(),x.end(),greater<>()
#define pb push_back
#define ll long long 
#define P pair<int,int>
#define LP pair<ll,ll>
using namespace std;

int main() {
    int n, x, m, magic;
    P ma;
    ll cnt=0;
    cin >> n >> x >> m;
    bool f = 1;
    vector<P> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].first;
        a[i].second = i;
        ma.first = max(ma.first, a[i].first);
        if (ma.first == a[i].first) ma.second = a[i].second;
    }
    magic = min(n, m);
    if (magic < ma.second + 1) f = 0;
    ma.first = 0;
    for (int i = 0; i < magic; i++) {
        a[i].first/=2;
        ma.first = max(ma.first, a[i].first);
    }
    m -= magic;
    if (x < ma.first) f = 0;
    if (f) cout << "Yes" << endl;
    else cout << "No" << endl;
	return 0;
}