#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k, a[1010], cnt = 0;
  scanf("%lld %lld", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    if (a[i] <= 2 * k)
      k = max(k, a[i]);
    else {
      while (a[i] > 2 * k) {
        k = k * 2;
        cnt++;
      }
      k = max(k, a[i]);
    }
  }
  printf("%lld\n", cnt);
}
