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