#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dy[] = {0, 0, 1, -1, -1, 1, 1, -1};
int biton(int n, int pos) { return n = n | (1 << pos); }
int bitoff(int n, int pos) { return n = n & ~(1 << pos); }
bool bitcheck(int n, int pos) { return (bool)(n & (1 << pos)); }
inline int nxt() {
  int a;
  scanf("%d", &a);
  return a;
}
inline long long int NXT() {
  long long int a;
  scanf("%lld", &a);
  return a;
}
int main() {
  int n = nxt();
  long long int k = NXT();
  vector<long long int> v;
  for (int i = 0; i < n; i++) v.push_back(NXT());
  sort(v.begin(), v.end());
  long long int mx = k;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (((v[i] + 1) / 2) <= mx) {
      mx = max(mx, v[i]);
    } else {
      long long int lagbe = (v[i] + 1) / 2;
      while (mx < lagbe) {
        mx <<= 1;
        ans++;
      }
      mx = max(mx, v[i]);
    }
  }
  cout << ans << endl;
}
