#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	int N, X, M;
	cin >> N >> X >> M;
	vector<int> d(N);
	for (int i = 0; i < N; i++) {
		int a;
		cin >> a;
		int cnt = 0;
		while (X <= a) {
			a /= 2;
			cnt += 1;
		}
		d[i] = cnt;
	}
	for (int i = N - 2; i >= 0; i--) {
		d[i] = max(d[i], d[i + 1]);
	}
	int sum = 0;
	for (int i = 0; i < N; i++) {
		sum += d[i];
	}
	cout << (sum <= M ? "Yes" : "No") << endl;
	return 0;
}