#include <bits/stdc++.h>
using namespace std;
const long long maxLL = 1e18;
const long long maxL = 4294967296LL;
const long long maxI = 32767LL;
const long long maxB = 255LL;
const double PI = atan(1) * 4;
long long res, n, k, ol, i, a[111111];
int main() {
  ios_base ::sync_with_stdio(0);
  cin >> n >> ol;
  for (i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  for (i = 1; i <= n; ++i) {
    if ((a[i] + 1) / 2 <= ol) {
      ol = max(ol, a[i]);
      continue;
    }
    while ((a[i] + 1) / 2 > ol) {
      ++res;
      ol *= 2;
    }
    ol = max(ol, a[i]);
  }
  cout << res;
  return 0;
}
