#include <bits/stdc++.h>
using namespace std;
int main() {
  long double k;
  int n;
  cin >> n >> k;
  long double val = 2 * k;
  long double arr[n + 1];
  for (int i = 1; i <= n; i++) cin >> arr[i];
  sort(arr + 1, arr + 1 + n);
  int i = 1;
  int cnt = 0;
  while (i <= n) {
    if (arr[i] > val) {
      while (val < arr[i]) val *= 2, cnt++;
    }
    val = max(val, 2 * arr[i]);
    i++;
  }
  cout << cnt;
  return 0;
}
