#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

int main() {

  for(int N, S; cin >> N >> S && (N | S);) {
    int A[N + 1];
    rep(i, N) {
      cin >> A[i];
    }

    sort(A, A + N);
    A[N] = inf;

    ll sum = 0;

    rep(i, N - 1) {
      int j = upper_bound(A + i + 1, A + N + 1, S - A[i]) - A;
      sum += N - j;
    }

    cout << sum << endl;
  }

  
  return 0;
}