#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

int main(){
  ll n,x;
  cin>>n>>x;
  
  map<ll,ll> m;
  ll y;
  rep(i,n){
    cin>>y;
    m[y]++;
  }
  
  ll sum=0;
  for(auto t:m){
    if(t.first>2*x) break;
    else sum+=t.second*m[x-t.first];
  }
  cout<<sum<<endl;
  return 0;
}