#include <bits/stdc++.h>

using namespace std;

int v[105],n,s,sum;
struct loto {
    int a;
    int b;
    int c;
};
unordered_map <int, loto> mp;
int main () {
    ifstream fin("loto.in");
    ofstream fout("loto.out");
    fin >> n >> s;
    for (int i = 1;i <= n;i++)
        fin >> v[i];
    for (int i = 1;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[s - sum].a << " " << mp[s - sum].b << " " << mp[s - sum].c;
                    return 0;
                }
            }
        }
    }
    fout << -1;
    return 0;
}