#include <bits/stdc++.h>
using namespace std;
int main() {
int n;int tg;
cin>>n;cin>>tg;
vector <int> ar;
for(int i=0;i<=n-1;i++){
int y;cin>>y;
ar.push_back(y);
}
int ct = 0;
unordered_map<int, int> mp;
for (int j = 0; j < n; j++) {
int df = tg - ar[j];
if (mp.count(df)) {
ct += mp[df];
}
mp[ar[j]]++;
}
cout << ct << endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKICAgIAogICAgaW50IG47aW50IHRnOwogICAgY2luPj5uO2Npbj4+dGc7IAogICAgdmVjdG9yIDxpbnQ+IGFyOwogICAgZm9yKGludCBpPTA7aTw9bi0xO2krKyl7CiAgICAJaW50IHk7Y2luPj55OyAKICAgIAlhci5wdXNoX2JhY2soeSk7IAogICAgfQogICAgCgogICAgaW50IGN0ID0gMDsKICAgIHVub3JkZXJlZF9tYXA8aW50LCBpbnQ+IG1wOwoKICAgIGZvciAoaW50IGogPSAwOyBqIDwgbjsgaisrKSB7CiAgICAgICAgaW50IGRmID0gdGcgLSBhcltqXTsKCiAgICAgICAgaWYgKG1wLmNvdW50KGRmKSkgewogICAgICAgICAgICBjdCArPSBtcFtkZl07CiAgICAgICAgfQoKICAgICAgICBtcFthcltqXV0rKzsKICAgIH0KCiAgICBjb3V0IDw8IGN0IDw8IGVuZGw7CgogICAgcmV0dXJuIDA7Cn0=