#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin>>n>>k;
vector<int> numbers(n);
for(auto& number: numbers){
cin>>number;
}
unordered_map<int,int> hashMap;
int answer = 0;
for(int i=0; i<n; i++){
if(hashMap.find(k - numbers[i]) != hashMap.end()){
answer+= hashMap[k - numbers[i]];
}
hashMap[numbers[i]]++;
}
cout<<answer;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuLGs7CgljaW4+Pm4+Pms7CgkKCXZlY3RvcjxpbnQ+IG51bWJlcnMobik7CgkKCWZvcihhdXRvJiBudW1iZXI6IG51bWJlcnMpewoJCWNpbj4+bnVtYmVyOwoJfQoJCgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+IGhhc2hNYXA7CglpbnQgYW5zd2VyID0gMDsKCQoJZm9yKGludCBpPTA7IGk8bjsgaSsrKXsKCQkKCQkKCQlpZihoYXNoTWFwLmZpbmQoayAtIG51bWJlcnNbaV0pICE9IGhhc2hNYXAuZW5kKCkpewoJCQlhbnN3ZXIrPSBoYXNoTWFwW2sgLSBudW1iZXJzW2ldXTsKCQl9CgkJCgkJaGFzaE1hcFtudW1iZXJzW2ldXSsrOwoJfQoJCgljb3V0PDxhbnN3ZXI7CgkKCXJldHVybiAwOwp9