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

int main() {
  int n, x;
  cin>>n>>x;

  map<int, long> m;
  for (int i=0; i<n; i++) {
    int a;
    cin>>a;
    ++m[a];
  }
  long long ans = 0;
  for (auto e: m) {
    int a = e.first;
    long cnt = e.second;
    auto it = m.lower_bound(x - a);
    if (it == m.end()) {
      continue;
    } else if ((*it).first == x - a) {
      ans += cnt * (*it).second;
    }
  }
  cout<<ans<<endl;
}