#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
typedef pair<int,int> P;
#define fi first
#define se second
#define all(v) (v).begin(),v.end()
set<string> c;
const ll inf=(1e18);
const ll mod=1000000007;
const ll mod2=998244353;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
//ios_base::sync_with_stdio(false);
//cin.tie(NULL);
map<int,ll> mp;
int main(){
  int n,m;
  cin>>n>>m;
  vector<ll> a(n);
  for(int i=0;i<n;i++){
    cin>>a[i];
    mp[a[i]]++;
  }
ll ans=0;
for(int i=0;i<n;i++){
     ll tmp=m-a[i];

     if(tmp==a[i]) ans+=mp[a[i]]*mp[a[i]];
     else ans+=mp[tmp]*mp[a[i]]*2;
     mp[a[i]]=0;mp[tmp]=0;
}
cout<<ans<<endl;
}