#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  vector<int> A(n);
  int i;
  for (i = 0; i < n; ++i) scanf("%d", &A[i]);
  sort(A.begin(), A.end());
  int ans = 0;
  for (i = 0; i < n; ++i) {
    while (k * 2 < A[i]) {
      k *= 2;
      ans++;
    }
    k = max(k, A[i]);
  }
  cout << ans << endl;
}
