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