#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int N; long long K; cin >> N >> K;
  vector<long long> A(N);
  for (long long &i: A) cin >> i;
  sort(A.begin(), A.end());
  long long ans = 0;
  for (int i = 0; i < N; i++) {
    long long t = 2 * K / A[i];
    if (2 * K % A[i] != 0) t++;
    ans += A.size() - (lower_bound(A.begin(), A.end(), t) - A.begin());
  }
  cout << ans << endl;
  return 0;
}