#include <bits/stdc++.h>
using namespace std;
int partition(long arr[], int l, int h) {
  int i = l - 1;
  long pivot = arr[h];
  for (int j = l; j < h; j++) {
    if (arr[j] < pivot) {
      i++;
      long temp = arr[i];
      arr[i] = arr[j];
      arr[j] = temp;
    }
  }
  long temp = arr[h];
  arr[h] = arr[i + 1];
  arr[i + 1] = temp;
  return (i + 1);
}
void quicksort(long arr[], int l, int h) {
  if (l < h) {
    int i = partition(arr, l, h);
    quicksort(arr, l, i - 1);
    quicksort(arr, i + 1, h);
  }
}
int main() {
  int n;
  long k;
  cin >> n;
  cin >> k;
  long *arr = new long[n];
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
  }
  quicksort(arr, 0, n - 1);
  long count = 0;
  long min = k;
  for (int i = 0; i < n; ++i) {
    if (2 * min < arr[i]) {
      while (2 * min < arr[i]) {
        min = min * 2;
        count++;
      }
      min = arr[i];
    } else if (min < arr[i]) {
      min = arr[i];
    }
  }
  cout << count;
}
