#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<math.h>
#define all(x) x.begin(),x.end()
#define gall(x) x.begin(),x.end(),greater<>()
#define pb push_back
#define ll long long 
#define P pair<double,double>
#define LP pair<ll,ll>
using namespace std;
int main() {
	ll n,k,ans=0;
	cin >>n>>k;
	vector<ll> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(all(a));
	for (int i = 0; i < n; i++) {
		ll tmp = lower_bound(a.begin(), a.end(), (2 * k + a[i] - 1) / a[i]) -a.begin();
		ans += n - tmp;
	}
	cout << ans << endl;
	return 0;
}