#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<long long> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  sort(v.begin(), v.end());
  long long d = k;
  long long out = 0;
  for (int i = 0; i < n; i++) {
    while (2 * d < v[i]) {
      d *= 2;
      out++;
    }
    d = max(d, v[i]);
  }
  cout << out << endl;
  return 0;
}
