#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using uint = unsigned; using vi = vector; using vl = vector; using vll = vector; using vd = vector; using vvi = vector; using vvl = vector; using vvll = vector; using vc = vector; using vs = vector; using vb = vector; using pii = pair; using pcc = pair; using pll = pair; using pdd = pair; using vpii = vector; using vpll = vector; typedef complex xy_t; #define rep(i, n) for (ll i = 0; i < ll(n); i++) #define repback(i, n) for (ll i = n-1; i >= 0; i--) #define REP(i, a, b) for (ll i = a; i < ll(b); i++) #define REPBACK(i, a, b) for (ll i = a-1; i >= ll(b); i--) #define all(x) (x).begin(), (x).end() #define debug(x) cout << "debug:" << x << endl static const double pi = acos(-1.0); const long long INFL = pow(10,18); const long long INFLMAX = 9223372036854775807; const int INF = pow(10,9); const int INFMAX = 2147483647; const int mod1 = 1000000007; const int mod2 = 998244353; const vi dx = {1,0,-1,0}; const vi dy = {0,1,0,-1}; const vi dx2 = {0, 1, 0, -1, 1, -1, 1, -1}; const vi dy2 = {1, 0, -1, 0, 1, 1, -1, -1}; int main(){ ll N,X,M; cin >> N >> X >> M; vll A(N); vll need(N); rep(i,N){ cin >> A[i]; int tmp = 0; while(A[i] / pow(2, tmp) >= X) tmp++; need[i] = tmp; } ll maxnow = 0; repback(i,N){ //debug(M); if(maxnow < need[i]) { M -= (need[i] - maxnow) * (i+1); maxnow = need[i]; } } if(M >= 0) cout << "Yes" << endl; else cout << "No" << endl; }