#include <fstream>
#include <unordered_map>
#define DIM 101
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n,s,v[DIM];
struct elem {
    int x,y,z;
};
unordered_map<int,elem> f;
int main() {
    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++)
                f[v[i]+v[j]+v[k]]={v[i],v[j],v[k]};
    for (int i=1;i<=n;i++)
        for (int j=i;j<=n;j++)
            for (int k=j;k<=n;k++) {
                int nr=s-v[i]-v[j]-v[k];
                if (f.count(nr)>0) {
                    fout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<f[nr].x<<" "<<f[nr].y<<" "<<f[nr].z;
                    return 0;
                }
            }
    fout<<-1;
    return 0;
}