#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,x ; cin>>n>>x;
vector<int>arr(n);
for(int i = 0 ; i<n;i++){
cin>>arr[i];
}
int count = 0 ;
unordered_map<int,int>hash;
for(int i =0;i<n;i++){
if(hash.find(x-arr[i])!=hash.end()){
count+=hash[x-arr[i]];
}
hash[arr[i]]++;
}
cout<<count;
// your code goes here
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IG4seCA7IGNpbj4+bj4+eDsKCXZlY3RvcjxpbnQ+YXJyKG4pOwoJZm9yKGludCBpID0gMCA7IGk8bjtpKyspewoJCWNpbj4+YXJyW2ldOwoJfQoJaW50IGNvdW50ID0gMCA7IAoJdW5vcmRlcmVkX21hcDxpbnQsaW50Pmhhc2g7Cglmb3IoaW50IGkgPTA7aTxuO2krKyl7CgkJaWYoaGFzaC5maW5kKHgtYXJyW2ldKSE9aGFzaC5lbmQoKSl7CgkJCWNvdW50Kz1oYXNoW3gtYXJyW2ldXTsKCQl9CgkJaGFzaFthcnJbaV1dKys7CQoJfQoJY291dDw8Y291bnQ7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglyZXR1cm4gMDsKfQ==