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