#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main(int argc, char *argv[]) {
	int n, s;cin >> n >> s;
	vector<int> cows(n);
	for (int i = 0;i < n;++i) cin >> cows[i];
	sort(cows.begin(), cows.end());
	int ans = 0;
	for (int i = 0;i < n;++i) {
		ans += upper_bound(cows.begin(), cows.end(), s - cows[i]) - cows.begin();
		if (cows[i] <= (s - cows[i]) ) --ans;
	}
	cout << ans / 2 << endl;
}