#include <bits/stdc++.h>
using namespace std;
vector<bool> solved;
int main() {
  int n, k;
  cin >> n >> k;
  int arr[n];
  for (int i = 0; i < (n); i++) cin >> arr[i];
  solved.resize(n);
  int question = 0, solvedcnt = 0;
  while (solvedcnt < n) {
    bool tempsolvedflag = false;
    for (int i = 0; i < (n); i++) {
      if (!solved[i] && arr[i] <= k * 2) {
        solved[i] = true;
        solvedcnt++;
        tempsolvedflag = true;
        k = max(k, arr[i]);
      }
    }
    if (!tempsolvedflag) {
      question++;
      k *= 2;
    }
  }
  cout << question;
}
