#include <bits/stdc++.h>

using namespace std;

int v[105];

struct loto {
    int a;
    int b;
    int c;
};

unordered_map <int, loto> mp;

int main() {
    ifstream fin("loto.in");
    ofstream fout("loto.out");
    int n,s,sum;
    fin >> n >> s;
    for (int i = 0;i < n;i++)
        fin >> v[i];
    for (int i = 0;i < n;i++)
        for (int j = i;j < n;j++)
            for (int k = j;k < n;k++) {
                sum = v[i] + v[j] + v[k];
                mp[sum] = {v[i], v[j], v[k]};
                if (mp.find(s - sum) != mp.end()) {
                    fout << v[i] << " " << v[j] << " " << v[k] << mp.find(s - sum).a << " " << mp.find(s - sum).b << " " << mp.find(s - sum).c;
                    return 0;
                }

            }
    fout << "-1";
    return 0;
}