/**
  @file 1882.cpp
  @title  No.1882 Areas of Triangle - yukicoder
  @url https://yukicoder.me/problems/no/1882
**/

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef unsigned long long uLL;
typedef unsigned int uint;

#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((int)(x).size())

#define REPI(i, a, b) for (LL i = LL(a); i < LL(b); ++i)
#define REP(i, N) for (LL i = LL(0); i < LL(N); ++i)
#define REPS(i, N) for (int i = 1; i <= (int)(N); i++)
#define RREP(i, N) for (int i = ((int)(N)-1); i >= 0; i--)
#define RREPS(i, N) for (int i = ((int)(N)); i > 0; i--)

#define chmax(ret, x) ret = max(ret, x)
#define chmin(ret, x) ret = min(ret, x)

#define FILL(x, e) memset(x, e, sizeof(x))
#define ZEROS(x) fill(x, 0)

#define SORT(x) sort(ALL(x))
#define RSORT(x) sort(RALL(x))

#define UNIQ(x) x.erase(unique(ALL(x)), x.end())

#define BIT(n) (1LL << (n))

#define OUT(x) cout << (x) << "\n"
#define DEBUG(x) cerr << #x << " : " << x << "\n"
#define DEBUG2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second

const int MOD = 1e9 + 7;

void iostream_init() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.setf(ios::fixed);
  cout.precision(12);
  // cout.fill('0');
  // cout.width(3);
}

template <class T>
void show(vector<T>& v) {
  for (uint i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
}

int main() {
  ::iostream_init();

  LL N, K;
  cin >> N >> K;
  vector<LL> A(N, 0);
  REP(i, N) {
    cin >> A[i];
  }
  SORT(A);

  // naive
  // LL limit = (LL)sqrt(2 * K);
  // if (A[N - 1] < limit) {
  //   OUT(0);
  // } else {
  //   LL ret = 0;
  //   REP(i, N) {
  //     REP(j, N) {
  //       if (A[i] * A[j] >= 2 * K) {
  //         ret++;
  //       }
  //     }
  //   }
  //   OUT(ret);
  // }

  // add condition
  LL ret = 0;
  REP(i, N) {
    LL Aj = (2 * K + A[i] - 1) / A[i];
    LL j  = lower_bound(ALL(A), Aj) - A.begin();
    // cout << std::distance(A.begin(), lower_bound(ALL(A), Aj)) << endl;
    ret += N - j;
  }
  OUT(ret);

  return 0;
}