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