#include <iostream>
#include <unordered_map>
#include <fstream>
using namespace std;
struct suma
{
    int x,y,z;
};
fstream fin("loto.in");
ofstream fout("loto.out");
int main()
{
    unordered_map<int, suma> mapp;
    int n,s,ok;
    fin>>n;
    fin>>s;
    int v[100];
    suma elem;
    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++)
            {
                elem.x=v[i];
                elem.y=v[j];
                elem.z=v[k];
                mapp.insert(make_pair(v[i]+v[j]+v[k], elem));
            }
        }
    }

    for(int i = 0; i < n; i++)
    {
        for(int j = i; j < n; j++)
        {
            for(int k = j; k < n; k++)
            {
                if(mapp.find(s-(v[i]+v[j]+v[k]))!=mapp.end())
                {
                    fout<< mapp[s - v[i] - v[j] - v[k]].x << " " << mapp[s - v[i] - v[j] - v[k]].y << " " << mapp[s - v[i] - v[j] - v[k]].z<<" "<< mapp[v[i] + v[j] + v[k]].x << " " << mapp[v[i] + v[j] + v[k]].y << " " << mapp[v[i] + v[j] + v[k]].z;
                    return 0;
                }
            }
        }
    }
        fout<<-1;
    return 0;
}