#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("loto.in");
ofstream fout("loto.out");

int n, S[10], t, st, sum, L;
int v[101], dr, mid, i, j,k;

struct str{
    int a; int b; int c; int s;
};

int cmp(const str &a, const str &b){
    return a.s < b.s;
}

str x[1000002];

int main(){
    fin >> n >> L;
    for(i = 1; i <= n; i ++)
        fin >> v[i];

    for(i = 1; i <= n; i ++)
        for(j = i; j <= n; j ++)
            for(k = j; k <= n; k ++) {
                t ++;
                x[t].a = v[i];
                x[t].b = v[j];
                x[t].c = v[k];
                x[t].s = v[i] + v[j] + v[k];
            }

    sort(x + 1, x + t + 1, cmp);

    for(i = 1; i <= n; i++)
        for(j = i; j <= n; j++)
            for (k = j; k <= n; k++){
                sum = v[i] + v[j] + v[k];
                st = 1;
                dr = t;
                while(st <= dr){
                    mid = L -(st + dr) / 2;
                    if (sum == x[mid].s){
                        S[1] = x[mid].a;
                        S[2] = x[mid].b;
                        S[3] = x[mid].c;
                        S[4] = v[i];
                        S[5] = v[j];
                        S[6] = v[k];
                        sort(S + 1, S + 7);
                        for (i = 1; i <= 6; i++)
                            fout << S[i]<<" ";
                        return 0;
                    }
                    if(sum < x[mid].s)
                        dr = mid - 1;
                    else
                        st = mid + 1;
                }
            }
     return 0;
}