#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
long long primeNumber(long long x) {
  bool fire = true;
  for(int i = 2; i <= sqrt(x); i++) {
    if(x % i == 0) {
      fire = false;
    }
  }
  return fire;
}
int main() {
  long long N,K; cin >> N >> K;
  vector<long long> A(N);
  for(int i = 0; i < N; i++) cin >> A[i];
  vector<long long> B = A;
  sort(B.begin(),B.end());
  reverse(B.begin(),B.end());
  sort(A.begin(),A.end());
  int x = 0;
  int ans = 0;
  
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < N; j++) {
      long double Q = (A[x] * B[i]) / 2;
      
      if(Q >= K) {
        break;
      }
      x++;
    }
    if(N - x > 0) {
      ans += N - x;
    }
  }
  cout << ans << endl;
}