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

using ll = long long;
#define rep(a, b, c) for(int a == b; a < c; a++)

int main()
{
	int N;
	ll K;
	cin >> N >> K;
	vector<ll> A( N + 1);
    A[N] = 4e18;
	for( int i = 0; i < N; i++ ) cin >> A[i];

	sort( A.begin(), A.end() );
	ll ans = 0;
	for( int i = 0; i < N; i++ ) {
		ans += A.end() - lower_bound( A.begin(), A.end(), (K * 2 + A[i] - 1) / A[i]) - 1;
	}

	cout << ans << endl;
}