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