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