#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    int N;
    long long X;
    cin >> N >> X;
    vector<long long> A(N);
    for ( int i = 0; i < N; i++ ) {
        cin >> A[i];
    }
    sort( A.begin(), A.end() );

    long long ans = 0;
    for ( int i = 0; i < N; i++ ) {
        if ( X >= A[i] ) { ans += lower_bound( A.begin(), A.end(), X-A[i]+1 ) - lower_bound( A.begin(), A.end(), X-A[i] ); }
    }
    cout << ans << endl;
    return 0;
}