#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, arr[1010];
  scanf("%d", &n);
  scanf("%d", &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &arr[i]);
  }
  sort(arr, arr + n);
  long long int d = k;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    while (d < ceil(arr[i] / 2.0)) {
      d *= 2;
      ans++;
    }
    d = max(d, (long long int)arr[i]);
  }
  printf("%d\n", ans);
  return 0;
}
