#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <math.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,int> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
ll n,x,a[100005],ans;
int main(void){
    cin>>n>>x;
    for(int i=0;i<n;i++){
        ll y;
        cin>>y;
        a[y]++;
    }
    for(int i=0;i<=100000;i++){
        if(0<=x-i&&x-i<=100000){
            ans+=a[i]*a[x-i];
        }
    }
    cout<<ans<<endl;
}