#include <bits/stdc++.h>
using namespace std;
long long a[1100];
bool solved[1100];
int main() {
  int n;
  long long k;
  cin >> n >> k;
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; ++i) solved[i] = false;
  int res = 0;
  while (true) {
    bool allsolved = true;
    for (int i = 0; i < n; ++i)
      if (!solved[i]) allsolved = false;
    if (allsolved) break;
    long long savk = k;
    bool new_update = false;
    for (int i = 0; i < n; ++i)
      if (2 * savk >= a[i] && !solved[i]) {
        solved[i] = true;
        new_update = true;
        if (a[i] > k) k = a[i];
      }
    if (k == savk && !new_update) {
      res++;
      k = 2 * savk;
    }
  }
  cout << res << endl;
  return 0;
}
