#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
long long mod = 1e9 + 7;

int main(void) {
  long long n, x; cin >> n >> x;
  vector<long long> a(n);
  map<long long, long long> m;
  for(int i=0; i<n; i++){
    cin >> a[i];
    m[a[i]]++;
  }

  long long cnt = 0;
  for(auto i=m.begin(); i!=m.end(); i++) {
    if(i->first*2 == x) {
      cnt += i->second * (i->second);
    }else{
      if(m.find(x - i->first) == m.end()) continue;
      cnt += i->second * m[x - i->first];
    }
  }
  cout << cnt << endl;
  

  return 0;
}



// EOF