#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, k;
  cin >> n >> k;
  long long int input;
  vector<long long int> a;
  for (int i = 0; i < n; i++) {
    cin >> input;
    a.push_back(input);
  }
  sort(a.begin(), a.end());
  long long int maxreach = k * 2;
  long long int sol = 0;
  for (int i = 0; i < n; i++) {
    if (maxreach >= a[i]) {
      maxreach = max(maxreach, a[i] * 2);
    } else {
      while (maxreach < a[i]) {
        sol++;
        maxreach = maxreach * 2;
      }
      maxreach = max(maxreach, a[i] * 2);
    }
  }
  cout << sol << endl;
}
