#include <bits/stdc++.h>
using namespace std;
long long a[1002];
int main() {
  int n;
  long long k;
  scanf("%d %I64d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%I64d", &a[i]);
  }
  long long mx = k * 2;
  sort(a, a + n);
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] <= mx) {
      mx = max(mx, a[i] * 2);
      continue;
    }
    while (a[i] > mx) {
      cnt++;
      mx = mx * 2;
    }
    mx = a[i] * 2;
  }
  cout << cnt << endl;
}
