#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>

using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n;
	int x;
	cin>>n>>x;
	int a[100001]={};
	for(int i=0; i<n; i++){
		int a1;
		cin>>a1;
		a[a1]++;
	}
	ll ans=0;
  if(x>200000){
    cout<<0<<endl;
    return 0;
  }
	for(int k=0; k<=x; k++){
      if(k>100000 || x-k>100000) continue;
		ans+=((ll)(a[k]))*((ll)(a[x-k]));
	}
	cout<<ans<<endl;
	return 0;
}