#include <bits/stdc++.h>
using namespace std;
int a[1111];
int main() {
  int n, k, ans = 0;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    if (a[i] <= 2 * k) {
      k = max(k, a[i]);
      continue;
    }
    while (a[i] > 2 * k) {
      k = k * 2;
      ans += 1;
    }
    k = max(k, a[i]);
  }
  cout << ans << endl;
}
