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