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

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rREP(i, k, n) for (int i = (int)(n)-1; i >= k; i--)

#define fi first
#define se second

#define vi vector<int>
#define pb push_back
#define mp make_pair

#define pcnt __builtin_popcount

typedef long long ll;

const int inf = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int main(){
    int n;
    ll x;
    cin >> n >> x;
    ll a[100100];
    rep(i,n) cin >> a[i];
    sort(a,a+n);
    int r = n-1;
    int l = 0;
    ll ans = 0;
    ll tmp = 0;
    while(l<=r){
        if(a[l]+a[r] > x){
            r--;
        }else if(a[l]+a[r]<x){
            l++;
        }else{
            int t = 1;
            int tb = 1;
            while(a[r]==a[r-1]) t++,r--;
            while(a[l]==a[l+1]) tb++,l++;
            if(r>l) ans += t*tb;
            else ans += t*(t-1)/2;
            l++;
        }
    }
    ans *=2;
    if(l==r&& a[l]+a[r]==x) ans+=1;
    cout << ans+tmp << endl;
    return 0;
}