#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cstring>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)

int main(){
  int n;
  ll x,m;
  cin >> n >> x >> m;
  vector<ll> a(n);
  vector<ll> count(n);
  rep(i,n) cin >> a[i];
  rep(i,n){
    ll z = a[i];
    while (z > x){
      count[i]++;
      z >>=1LL;
    }
  }
  ll now = 0;
  for (int i = n-1;i >= 0;i--){
    m -= max(0LL,count[i]*(i+1)-now);
    now += max(0LL,count[i]*(i+1)-now);
    if (m < 0){
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  

  return 0;
}