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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, pair<ll, ll> > P3;

const ll MOD = ll(1e9 + 7);
const ll LLINF = LLONG_MAX;
const int IINF = INT_MAX;
const int MAX_N = int(2e3) + 5;
const double EPS = 1e-8;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
#define SORT(v) sort((v).begin(), (v).end())
#define SORTR(v) sort((v).rbegin(), (v).rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)


int main() {
    ll n,x;
    map<ll,ll> mp;
    cin >> n >> x;
    REP(i,n){
        int a;
        cin >> a;
        mp[a]++;
    }
    ll ans = 0;
    for(auto itr : mp){
        if(itr.first > x)break;
        if(itr.first*2 == x)ans += itr.second*itr.second;
        else ans += itr.second*mp[x-itr.first];
    }
    cout << ans << endl;
    return 0;
}