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

int main()
{
	int64_t N, K;
	cin >> N >> K;
	vector<int64_t> A(N);
	for(int64_t i = 0; i < N; i++) cin >> A[i];
	
	sort(A.begin(), A.end(), greater<int64_t>());
	int64_t ans = 0;
	int64_t B;
	int64_t ok, ng, mid;
	for(int64_t i = 0; i < N; i++)
	{
		B = (2 * K + A[i] - 1) / A[i];
		ok = -1;
		ng = N;
		while(ng - ok != 1)
		{
			mid = (ng + ok) / 2;
			if(A[mid] >= B) ok = mid;
			else ng = mid;
		}
		ans += ok + 1;
	}
	cout << ans << endl;
	return 0;
}