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