#include <bits/stdc++.h>
using namespace std;

int main()
{
    int N, X, M;
    cin >> N >> X >> M;
    vector<int> A(N);
    for (int i = 0; i < N; i++)
    {
        cin >> A[i];
    }
    vector<int> T(N);
    for (int i = 0; i < N; i++)
    {
        int B = A[i];
        while (B >= X)
        {
            B /= 2;
            T[i]++;
        }
    }
    long long now = 0;
    for (int i = N - 1; i >= 0; i--)
    {
        long long x = max(T[i] - now, (long long)0);
        M -= x * (i + 1);
        now += x;
    }
    if (M >= 0)
    {
        cout << "Yes";
    }
    else
    {
        cout << "No";
    }
}