#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;

int N, K;
double A[101010];
ll cnt;

int main() {
  cin >> N >> K;
  for (int i = 0; i < N; i++) cin >> A[i];
  sort(A, A + N);
  for (int i = 0; i < N; i++) {
    double B = 2.0 * K / A[i];
    int pos = lower_bound(A, A + N, B) - A;
    cnt += N - pos;
  }
  cout << cnt << endl;
  return 0;
}