#include using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep1(i, n) for (int i = 1; i < (int)(n+1); i++) #define repn(i,a,b) for (int i = (int)(a) ; i < (int)(b+1); i++) #define repv(i, n) for (int i = (int)(n-1); i >= 0; i--) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define sz(x) ((int)(x).size()) #define cauto const auto& #define bit(n) (1LL<<(n)) #define uni(v) v.erase( unique(v.begin(), v.end()), v.end() ); using ll = long long; using P = pair; using PP = pair; using Graph = vector>; #ifdef LOCAL #include #define debug(...) debug::multi_print(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (static_cast(0)) #endif int main(){ int n,x,m; cin >> n >> x >> m; vector a(n); rep(i,n){ cin >> a[i]; } vector attacks(m+1,1e18); attacks[0] = x-1; rep(i,m){ if(attacks[i] <= 1e9){ attacks[i+1] = (attacks[i]*2+1); } else{ break; } } debug(attacks); int kaisuu = 0; int now_kaisuu_max = distance(attacks.begin(),lower_bound(all(attacks),a[0])); rep(i,n){ int now_kaisuu = distance(attacks.begin(),lower_bound(all(attacks),a[i])); kaisuu += distance(attacks.begin(),lower_bound(all(attacks),a[i])); debug(now_kaisuu); if(now_kaisuu_max < now_kaisuu){ now_kaisuu_max = now_kaisuu; kaisuu = now_kaisuu_max*(i+1); } } debug(kaisuu); cout << (kaisuu <= m ? "Yes" : "No") << endl; return 0; }