#include<fstream>
#include<vector>
using namespace std;
ifstream in("oite.in");
ofstream out("oite.out");
const int MOD = 100009;
int n,l,st,dr,mid,k,i,j,oite[1025],csum,alfa,beta,grupuri_de_oite,ok,mod;
vector<pair<int,int> >sume[MOD];
int main(){
    in >> n >> l;
    for( i = 1; i <= n; i ++ ){
        in >> oite[i];
    }
    sume[(oite[1] + oite[2] ) %MOD].push_back( make_pair (oite[1] + oite[2] ,1) );
    for( i = 3; i <= n-1; i ++ ){
        for( j = i+1; j <= n; j ++ ){
            csum = l -oite[i] - oite[j];
            if( csum > 0 ){
                mod = csum%MOD;
                for( k = 0; k < sume[mod].size(); k ++ ){
                    if( sume[mod][k].first == csum ){
                        grupuri_de_oite+= sume[mod][k].second;
                    }
                }
            }

        }
        for( j = 1; j <= i-1; j ++ ){
            ok = 0;
            mod = (oite[i] + oite[j] ) %MOD;
            for( k = 0; k < sume[ mod ].size(); k++ ){
                if( sume[mod][k].first == oite[i]+oite[j] ){
                    ok = 1;
                    sume[mod][k].second++;
                    break;
                }
            }
            if(ok == 0){
                sume[ mod ].push_back( make_pair(oite[i] + oite[j] ,1) );
            }
        }
    }
    out<<grupuri_de_oite;
    return 0;
}