#include <cstdio>
#include <algorithm>

FILE* in;
FILE* out;

const int Q=101,W=171750;

int v[Q];

int n,s;



struct chestie{
    int val;
    int nr[4];
} a[W];
int srt[W];

int nxt;

int act[4],sum;
//bool verif[Q];

void make_sumde3(int pas)
{

    for(int i=1; i<=n; i++)
        for(int j=i; j<=n; j++)
            for(int k=j; k<=n; k++)
    {
        a[++nxt].val=v[i]+v[j]+v[k];
        a[nxt].nr[1]=v[i];
        a[nxt].nr[2]=v[j];
        a[nxt].nr[3]=v[k];
        srt[nxt]=nxt;
    }
}

bool cmp (int x, int y)
{
    return a[x].val<a[y].val;
}

int main()
{
    in=fopen("loto.in","r");
    out=fopen("loto.out","w");

    fscanf(in,"%d%d",&n,&s);

    for(int i=1; i<=n; i++)
    {
        fscanf(in,"%d",&v[i]);
       // fprintf(out,"%d ",i);
    }

    make_sumde3(1);

    std::sort(srt+1,srt+nxt+1,cmp);

    for(int i=1; i<=nxt; i++)
        fprintf(out,"%d\n",a[srt[i] ].val);

    return 0;
}