#include <bits/stdc++.h>
using namespace std;
const int nMax = 1005;
int a[nMax];
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  sort(a + 1, a + n + 1);
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    while (a[i] > 2 * k) {
      k *= 2;
      ans++;
    }
    k = max(k, a[i]);
  }
  cout << ans;
  return 0;
}
