#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  long long ind = 0, xtr = 0;
  sort(a, a + n);
  while (ind < n) {
    for (long long i = ind; i < n; i++) {
      if (a[i] > 2 * k) {
        ind = i;
        break;
      } else if (i == n - 1 and a[i] <= 2 * k) {
        ind = n;
        break;
      }
      k = max(k, a[i]);
    }
    if (ind != n) {
      if (ind > 0) k = max(k, a[ind - 1]);
      k = 2 * k;
      xtr++;
    }
  }
  cout << xtr << endl;
  return 0;
}
