#include <bits/stdc++.h>
using namespace std;
int a[1000];
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 num = 0, le = k;
  for (int i = 0; i < n; i++) {
    while (le * 2 < a[i]) {
      le *= 2;
      num++;
    }
    le = max(le, a[i]);
  }
  printf("%d", num);
  return 0;
}
