#include <bits/stdc++.h>
using namespace std;

int N, X, M;
int A[200009];

int main() {
    cin >> N >> X >> M;
    for (int i = 0; i < N; i++) cin >> A[i];
    vector<pair<int, int>> vp;
    for (int i = 0; i < N; i++) {
        if (A[i] >= X) {
            int cnt = 0;
            int val = 1;
            while (A[i]-X >= val) {
                cnt++;
                val *= 2;
            }
            vp.emplace_back(cnt, i+1);
        }
    }
    int sum_cnt = 0;
    int cost = 0;
    for (int i = vp.size()-1; i >= 0; i--) {
        cost += max(0, vp[i].second * (vp[i].first-sum_cnt));
        sum_cnt += max(0, vp[i].second-sum_cnt);
    }
    if (cost <= M) cout << "Yes" << endl;
    else cout << "No" << endl;
}