#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
using namespace std;

#define REP(i,n) for(int i=0;(i)<(n);(i)++)
#define ll long long
#define int long long

int N, X;
int a[100005];
int ans;
signed main() {
	cin >> N >> X;
	for (int i = 0;i < N;i++) {
		cin >> a[i];
	}
	sort(a, a+N);
	ans = 0;
	for (int i = 0;i < N;i++) {
		ans += upper_bound(a, a + N, X - a[i]) - lower_bound(a, a + N, X - a[i]);
	}

	cout << ans << endl;
	return 0;
}