//#include <iostream>
#include <fstream>
#include <unordered_map>
#include <random>
#include <iterator>
#include <algorithm>
using namespace std;
unordered_map <int,int> sum;
int v[1500],n,l,suma,var;
int main()
{
    ifstream cin("oite.in");
    ofstream cout("oite.out");
    cin>>n>>l;
    for(int i=1;i<=n;i++){
        cin>>v[i];
    }
    sort(v+1,v+n+1);
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if(v[i]+v[j]<=l)
                var+=sum[l-v[i]-v[j]];
            else
                break;
        }
        for(int j=1;j<i;j++){
            if(v[i]+v[j]<=l){
                sum[v[i]+v[j]]++;
            }
            else
                break;
        }
    }
    cout<<var;
    return 0;
}
//13 1 12 1 12 1