#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int main(){
    int n, L;
    cin >> n >> L;

    vector<long long> numb(n);

    for (int i = 0; i < n; i++){
        cin >> numb[i];
    }

    sort(numb.begin(), numb.end());

    vector<long long> bin(16);
    for (int i = 0; i < 16; i++){
        bin[i] = pow(2, i);
    }

    long long i = 0;
    long long j = 0;
    while(i < n && i * j <= L){
        j = 0;
        while (numb[i] >= bin[j]){
            j++;
        }
        i++;
    }
    if (i * j > L)
        cout << i - 1;
    else
        cout << i;


    return 0;
}