#include<bits/stdc++.h>
using namespace std;
long long n,x;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> x;
long long count = 0;
long long A[n];
map<long long ,long long> num;
for (long long i = 0; i < n; i++){
cin >> A[i];
num[A[i]]++;
}
for (auto i:num){
long long n = i.first;
long long m = x - n;
if (m > n){
if (num.find(m) != num.end()){
count += num[n] * num[m];
}
}
if (m == n){
count += num[n] * (num[n] - 1) / 2;
}
}
cout << count;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKbG9uZyBsb25nIG4seDsKaW50IG1haW4oKXsKCWlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7CgljaW4udGllKDApOwoJY291dC50aWUoMCk7CgkKCWNpbiA+PiBuID4+IHg7Cglsb25nIGxvbmcgY291bnQgPSAwOwoJbG9uZyBsb25nIEFbbl07CgltYXA8bG9uZyBsb25nICxsb25nIGxvbmc+IG51bTsKCQoJZm9yIChsb25nIGxvbmcgaSA9IDA7IGkgPCBuOyBpKyspewoJCWNpbiA+PiBBW2ldOwoJCW51bVtBW2ldXSsrOwoJfQoJCglmb3IgKGF1dG8gaTpudW0pewoJCWxvbmcgbG9uZyBuID0gaS5maXJzdDsKCQlsb25nIGxvbmcgbSA9IHggLSBuOwoJCWlmIChtID4gbil7CgkJCWlmIChudW0uZmluZChtKSAhPSBudW0uZW5kKCkpewoJCQkJY291bnQgKz0gbnVtW25dICogbnVtW21dOwoJCQl9CgkJfQoJCWlmIChtID09IG4pewoJCQljb3VudCArPSBudW1bbl0gKiAobnVtW25dIC0gMSkgLyAyOwoJCX0KCX0KCWNvdXQgPDwgY291bnQ7Cn0=