#include <bits/stdc++.h>
using namespace std;
int ost(int k, int res) {
  int ans = 0;
  while (k < (double)res / 2) {
    ans++;
    k *= 2;
  }
  return ans;
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (k < ((double)a[i]) / 2) ans += ost(k, a[i]);
    k = max(k, a[i]);
  }
  cout << ans;
  return 0;
}
