#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int const N = 100 * 1000 + 16;
int const M = 1000 * 1000 * 1000 + 7;
int n, k;
int a[1010];
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  cin >> n >> k;
  for (int i = 0; i < n; ++i) cin >> a[i];
  sort(a, a + n);
  int cnt = 0;
  for (int i = 0; i < n; ++i) {
    while (k + k < a[i]) {
      k <<= 1;
      ++cnt;
    }
    k = max(k, a[i]);
  }
  cout << cnt;
}
