#include <cstdio>
#include <algorithm>

using namespace std;

int v[101], N, S, sum[1030303];
FILE *in, *out;

void bc()
{
        int i,j,k,t = 1;
        for(i=1; i<=N; i++)
            for(j=1; j<=N; j++)
                for(k=1; k<=N; k++)
                {
                        sum[t] = sum[i] + sum[j] + sum[k];
                        t++;
                }
    }

    int main() {

        in = fopen("loto.in", "r");
        out = fopen("loto.out", "w");
        int i, inc = 1, sf;
        fscanf(in, "%d", &N);
        fscanf(in, "%d", &S);
        sf = N * N * N;
        for(i = 1; i <= N; i++)
            fscanf(in, "%d", &v[i]);
        bc()
        sort(sum + 1, sum + (N * N * N) + 1);
        for(i=1; i<=N; i++)
            for(j=1; j<=N; j++)
                for(k=1; k<=N; k++)
                {
                        while(inc <= sf)
                        {
                            mij = (inc + sf) / 2;
                            if(sum[mij] == S - v[i] - v[j] - v[k]);

                        }
                        t++;
                }
        return 0;
    }