#include <bits/stdc++.h> using namespace std; int main(){ int N, X, M; cin >> N >> X >> M; vector<long long> A(N); for(int i = 0; i < N; i++) cin >> A[i]; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q; for(int i = 0; i < N; i++){ if(A[i] >= X) q.push({i + 1, A[i]}); } while(q.size() > 0){ priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>nex; int ma = 0; while(!q.empty()){ auto [id, num] = q.top(); q.pop(); ma = max(ma, id); if(M - id < 0){ cout << "No" << endl; return 0; } num /= 2; if(num >= X){ nex.push({id, num}); } } M -= ma; q.swap(nex); } cout << "Yes" << endl; }