#include <bits/stdc++.h> //infoarena

using namespace std;

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

int n, s, l, st, dr, v[101], i, j, k;

struct John {

    int a;
    int b;
    int c;
    int suma;

}a[1000001];

bool comp (John a, John b){
    return (a.suma < b.suma);
}

int main()
{
    fin >> n >> s;

    for (i = 1; i <= n; ++i) fin >> v[i];

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

    sort (a + 1, a + l + 1, comp);

    st = 1;
    dr = l;

    while (st < dr){

        if (a[st].suma + a[dr].suma > s) dr --;
        if (a[st].suma + a[dr].suma < s) st ++;
        else {
            fout << a[st].a << ' ' << a[st].b << ' ' << a[st].c << ' ' << a[dr].a << ' ' << a[dr].b << ' ' << a[dr].c;
            return 0;
        }
    }

    return 0;
}