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