#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long n, k, arr[1000], l = -1, ans = 0;
  cin >> n >> k;
  for (long long f = 0; f <= n - 1; ++f) {
    cin >> arr[f];
  }
  sort(&arr[0], &arr[n - 1] + 1);
  while (l != n - 1) {
    if (2 * k < arr[l + 1]) {
      k *= 2;
      ans++;
    } else {
      k = max(arr[l + 1], k);
      l++;
    }
  }
  cout << ans;
  return 0;
}
