#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000000
int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for(int i=0;i<n;i++) {
        cin >> a[i];
    }

    sort(a.begin(), a.end());
    int p;
    int upper;
    int lower;
    int ans = 0; 
    for(int i=0;i<n;i++) {
        p = a[i];

        lower = distance(a.begin(), lower_bound(a.begin(), a.end(), m-p));
        upper = distance(a.begin(), upper_bound(a.begin(), a.end(), m-p));


        //cout << lower << " " << upper << endl;
        if(lower != 0) {
            if(p == m-p) ans+=upper-lower;
            else ans+=(upper-lower)*2;
        }
    }
    cout << ans << endl;
}