#include<map>
#include<iostream>
#include<deque>
#include<algorithm>
#include<string>
#include<cctype>
#include<iomanip>
#include<vector>
#include<queue>
 
using namespace std;
#define REP(i,b,e) for(int i=(int)b;i<(int)e;i++)
#define rep0(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
 
#define shosu setprecision(10)
typedef long long ll;

int N;
int X;
int a[100002];

int main(){
    cin>>N>>X;
    rep0(i,N) cin>>a[i];
    sort(a,a+N);
    ll ans=0;
    rep0(i,N){
        int b=X-a[i];
        int u=(upper_bound(a,a+N,b)-a);
        int l=(lower_bound(a,a+N,b)-a);
        ans+=(u-l);
    }
    cout<<ans<<endl;
    return 0;
    
}