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

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n,x; cin >> n >> x;
  vector<int> a(n);
  for(int i = 0; i < n; i++){
    cin >> a[i];
  }

  sort(a.begin(),a.end());

  int ans = 0;
  for(int i = 0; i < n; i++){
    int ok = n;
    int ng = -1;
    while(abs(ok-ng) > 1){
      int mid = (ok + ng) / 2;
      if(a[i] + a[mid] >= x) ok = mid;
      else ng = mid;
    }

    int lower = ok;
    ok = n;
    ng = -1;
    while(abs(ok-ng) > 1){
      int mid = (ok + ng) / 2;
      if(a[i] + a[mid] > x) ok = mid;
      else ng = mid;
    }
    ans += ok - lower;
  }
  cout << ans << endl;

  return 0;
}