#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstdio>
#include <iomanip>
#include <list>

#define PI 3.14159265358979323846
#define mod 1000000007
#define pow9 1000000000
#define INF (1 << 30)

using namespace std;

int main() {
	int n, x, m;
	cin >> n >> x >> m;
	vector<int> a(n + 1);
	int max_i = 0, max_i_idx = -1;
	bool max_i_flg;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		if (x <= a[i]) {
			max_i_idx = max(max_i_idx, i);
		}
		
	}

	

	while (true) {
		max_i_flg = false;
		if (m - max_i_idx >= 0) {
			for (int i = 1; i <= max_i_idx; i++) {
				a[i] /= 2;
			}
			m -= max_i_idx;

			max_i_idx = -1;

			for (int i = 1; i <= n; i++) {
				if (x <= a[i]) {
					max_i_idx = max(max_i_idx, i);
					max_i_flg = true;
				}
			}

			if (!max_i_flg) break;
		}
		else {
			break;
		}
	}

	for (int i = 1; i <= n; i++) {
		if (x <= a[i]) {
			cout << "No" << endl;
			return 0;
		}
	}

	cout << "Yes" << endl;

}