#include <bits/stdc++.h>
#define prime_n 6013
#define Nmax 102
using namespace std;
ifstream fin ("loto.in");
ofstream fout ("loto.out");
int n,S,v[Nmax];
vector<int> vo[prime_n+1];

void inserth(int q){
    vo[q%prime_n].push_back(q);
}

int nr(int q){
    int t=q%prime_n;
    for (vector<int> :: iterator it = vo[t].begin(); it != vo[t].end(); ++it)
        if(*it==q)return 1;
    return 0;
}

int main()
{

    int sum=-1;
    fin>>n>>S;
    for(int i=1;i<=n;++i)
        fin>>v[i];
    sort(v+1,v+n+1);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n && v[i]+v[j]<=S;++j)
            for(int k=1;k<=n && v[i]+v[j]+v[k]<=S;++k)
                inserth(v[i]+v[j]+v[k]);

    return 0;
}