#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    ll n, x;
    cin >> n >> x;
    map<ll,ll> mp;
    rep(i,n){
        ll a;
        cin >> a;
        mp[a]++;
    }
    ll ans = 0;

    for(auto p : mp){
        ll a = p.first;
        ll b = x - a;
        // if(a == b) continue;
        ans += mp[a] * mp[b];
    }

    cout << ans << endl;
    return 0;
}