#include <bits/stdc++.h>

using namespace std;

ifstream fin("loto.in");
ofstream fout("loto.out");
unordered_map<int, tuple<int, int, int>> sum;
int n, s, i, j, k, v[102];

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

    for(i = 1; i <= n; i++) {
        for(j = i; j <= n; j++) {
            for(k = j; j <= n; j++) {
                sum[v[i] + v[j] + v[k]] = {v[i], v[j], v[k]};
            }
        }
    }

    for(i = 1; i <= n; i++) {
        for(j = i; j <= n; j++) {
            for(k = j; j <= n; j++) {
                int scop = s - v[i] - v[j] - v[k];
                if(sum.find(scop) != sum.end()) {
                    int a, b, c;
                    tie(a, b, c) = sum[scop];

                    fout << v[i] << " " << v[j] << " " << v[k] << " " << a << " " << b << " " << c;
                    return 0;
                }
            }
        }
    }

    return 0;
}