#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;
int arr[maxn];
int n, k;
int main(void) {
  while (~scanf("%d%d", &n, &k)) {
    for (int i = 0; i < n; ++i) scanf("%d", arr + i);
    sort(arr, arr + n);
    int nowmax = k, cnt = 0;
    for (int i = 0; i < n; ++i) {
      if (arr[i] <= (nowmax << 1)) {
        if (arr[i] > nowmax) nowmax = arr[i];
      } else {
        while ((nowmax << 1) < arr[i]) {
          nowmax <<= 1;
          cnt++;
        }
        if (arr[i] > nowmax) nowmax = arr[i];
      }
    }
    printf("%d\n", cnt);
  }
}
