#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,x,m; cin >> n >> x >> m;
    vector<int> res(n+1);
    for(int i=0;i<n;i++){
        int a; cin >> a;
        while(a >= x){
            res[i]++;
            a /= 2;
        }
    }
    for(int i=n-2;i>=0;i--){
        res[i] = max(res[i], res[i+1]);
    }
    ll sum = 0;
    for(int i=n-1;i>=0;i--){
        sum += (ll)(i+1)*(res[i]-res[i+1]);
    }
    if(sum <= m){
        cout << "Yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
}