#include <bits/stdc++.h>
using namespace std;
long long mult(long long a, long long b, long long p = 1000000007) {
  return ((a % p) * (b % p)) % p;
}
long long add(long long a, long long b, long long p = 1000000007) {
  return (a % p + b % p) % p;
}
long long fpow(long long n, long long k, long long p = 1000000007) {
  long long r = 1;
  for (; k; k >>= 1LL) {
    if (k & 1LL) r = mult(r, n, p);
    n = mult(n, n, p);
  }
  return r;
}
long long inv(long long a, long long p = 1000000007) {
  return fpow(a, p - 2, p);
}
void self_max(int &a, int &b) { a = max(a, b); }
void self_min(int &a, int &b) { a = min(a, b); }
bool isPrime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
const long long sizes = 1e7 + 1;
int n, m, k, o, p;
void solve() {
  cin >> n >> k;
  int mx = k;
  std::vector<int> v;
  for (int i = 0; i < n; ++i) {
    cin >> o;
    v.push_back(o);
  }
  sort(v.begin(), v.end());
  long long count = 0;
  for (int i = 0; i < n; ++i) {
    while (v[i] > mx * 2) {
      count++;
      mx *= 2;
    }
    mx = max(mx, v[i]);
  }
  cout << count << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  int p = t;
  while (t--) {
    solve();
  }
}
