#include <bits/stdc++.h>
using namespace std;
int main() {
int n;int target;
cin>>n;cin>>target;
vector <int> ar;
for(int i=0;i<=n-1;i++){
int y;cin>>y;
ar.push_back(y);
}
int count =0;
unordered_map<int,int>mpp;
for(int j=0;j<n;j++){
int rem = target-ar[j];
if(mpp.find(rem)!=mpp.end())
count+=mpp[rem];
mpp[ar[j]]++;
}
cout<<count;
// your code goes here
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CiAKICAgIGludCBuO2ludCB0YXJnZXQ7CiAgICBjaW4+Pm47Y2luPj50YXJnZXQ7IAogICAgdmVjdG9yIDxpbnQ+IGFyOwogICAgZm9yKGludCBpPTA7aTw9bi0xO2krKyl7CiAgICAJaW50IHk7Y2luPj55OyAKICAgIAlhci5wdXNoX2JhY2soeSk7IAogICAgfQogICAgCmludCBjb3VudCA9MDsKdW5vcmRlcmVkX21hcDxpbnQsaW50Pm1wcDsKCmZvcihpbnQgaj0wO2o8bjtqKyspewoJaW50IHJlbSA9IHRhcmdldC1hcltqXTsKCQoJaWYobXBwLmZpbmQocmVtKSE9bXBwLmVuZCgpKQoJY291bnQrPW1wcFtyZW1dOwoJCgltcHBbYXJbal1dKys7Cn0KY291dDw8Y291bnQ7CgoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJcmV0dXJuIDA7Cn0=