#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() 
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n,k;
	cin>>n>>k;
 
	long long sum=0;
	int i,j,count=0;
	vector<int> hardness;
	for(i=0;i<n;i++){
		int data;
		cin>>data;
		hardness.push_back(data);
	}
 
	sort(hardness.begin(),hardness.end());
	for(i=0;i<n-1;i++){
		for(j=i+1;j<n;j++){
			sum=hardness[i]+hardness[j];
			if(sum>=k)break;
			else ++count;
		}
	}
	cout<<count;
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8dmVjdG9yPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgbWFpbigpIAp7Cglpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKCWNpbi50aWUoTlVMTCk7CglpbnQgbixrOwoJY2luPj5uPj5rOwoJCglsb25nIGxvbmcgc3VtPTA7CglpbnQgaSxqLGNvdW50PTA7Cgl2ZWN0b3I8aW50PiBoYXJkbmVzczsKCWZvcihpPTA7aTxuO2krKyl7CgkJaW50IGRhdGE7CgkJY2luPj5kYXRhOwoJCWhhcmRuZXNzLnB1c2hfYmFjayhkYXRhKTsKCX0KCQoJc29ydChoYXJkbmVzcy5iZWdpbigpLGhhcmRuZXNzLmVuZCgpKTsKCWZvcihpPTA7aTxuLTE7aSsrKXsKCQlmb3Ioaj1pKzE7ajxuO2orKyl7CgkJCXN1bT1oYXJkbmVzc1tpXStoYXJkbmVzc1tqXTsKCQkJaWYoc3VtPj1rKWJyZWFrOwoJCQllbHNlICsrY291bnQ7CgkJfQoJfQoJY291dDw8Y291bnQ7CglyZXR1cm4gMDsKfQ==

NyA0CjEwIDEgMyAxIDUgNSAw

7 4
10 1 3 1 5 5 0