#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
const int N = 2005;
int n;
long long k;
pair<long long, int> a[N];
int main() {
  scanf("%d %lld", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i].first);
  sort(a + 1, a + 1 + n);
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    while (k * 2 < a[i].first) {
      k *= 2, ++ans;
    }
    k = max(k, a[i].first);
  }
  printf("%d\n", ans);
  return 0;
}
