#include <bits/stdc++.h>
using namespace std;
long long int __gcd(long long int a, long long int b) {
  return (a % b) ? __gcd(b, a % b) : b;
}
bool prime(long long int k) {
  for (long long int i = 2; i * i <= k; i++)
    if (k % i == 0) {
      return false;
    }
  return true;
}
void pdash(int n = 1) {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 30; j++) {
      cout << "-";
    }
    cout << "\n";
  }
}
void solve() {
  int n, k;
  cin >> n >> k;
  int arr[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  long long int counter = 0;
  while (arr[0] > 2 * k) {
    k *= 2;
    counter++;
  }
  long long int upper_limit = 2 * max(arr[0], k);
  for (int i = 1; i < n; i++) {
    while (arr[i] > 2 * max(k, arr[i - 1])) {
      counter++;
      k = 2 * max(k, arr[i - 1]);
    }
  }
  cout << counter << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
