#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
using namespace std;
#define lint long long int
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
*/


int main() {
	lint n, X;
	cin >> n >> X;
	vector<lint>A(n);
	for (int i = 0; i < n; i++) {
		cin >> A[i];
	}
	sort(A.begin(), A.end());
	
	vector<lint>s(100000);
	for (int i = 0; i < n; i++) {
		s[A[i]]++;
	}


	lint serch;
	lint left;
	lint right;
	lint ans = 0;
	for (int i = 0; i < n; i++) {
		serch = X - A[i];
		left = 0;
		right = n - 1;
		while (right - left >= 0){
			lint mid = (left + right) / 2;
			if (serch == A[mid]) {
				ans+=s[A[mid]];
				break;
			}
			else if (serch < A[mid]) {
				right = mid-1;
			}
			else if (serch > A[mid]) {
				left = mid+1;
			}
			
		 } 
	}
	cout << ans << endl;
	
		
}