#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long n, k, temp;
  cin >> n >> k;
  vector<long long> arr;
  long long maximum = 0;
  for (long long i = 0; i < n; i++) {
    long long temp;
    cin >> temp;
    arr.push_back(temp);
  }
  sort(arr.begin(), arr.end());
  long long i = 0;
  long long want = 0;
  while (i < n) {
    if (arr[i] <= (2 * k)) {
      k = max(k, arr[i]);
      i++;
    } else {
      k = 2 * k;
      ++want;
    }
  }
  cout << want;
  return 0;
}
