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