#include <bits/stdc++.h>
using namespace std;
char arr[11][11];
int main() {
  vector<int> input;
  int n;
  int k;
  cin >> n >> k;
  input.resize(n);
  for (int i = 0; i < n; ++i) cin >> input[i];
  sort(input.begin(), input.end());
  if (2 * k >= input[n - 1]) {
    cout << 0 << endl;
    return 0;
  }
  int ans = 0;
  int i = 0;
  for (int i = 0; i < n; ++i) {
    while (2 * k < input[i]) {
      k *= 2;
      ans++;
    }
    k = max(k, input[i]);
  }
  cout << ans << endl;
  return 0;
}
