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