#include <fstream>
#include <unordered_map>
using namespace std;
int n,S,a[101];
struct triplet
{
    int x,y,z;
};
unordered_map <int,triplet> C;
void citire()
{
    ifstream fin("loto.in");
    fin>>n>>S;
    for(int i=1;i<=n;++i)
        fin>>a[i];
    fin.close();

}

int main()
{
    citire();
    ofstream fout("loto.out");
    int suma,i,j,k;
    for(i=1;i<=n;++i)
    {
        for(j=1;j<=n;++j)
        {
            for(k=1;k<=n;++k)
            {
                suma=a[i] + a[j] + a[k];
                triplet T;
                T.x=a[i];
                T.y=a[j];
                T.z=a[k];
                C[suma]=T;
                if(C.find(S-suma)!= C.end())
                {
                    fout<<a[i]<<" "<<a[j]<<" "<<a[k]<<" "<<C[S-suma].x<<" "<<C[S-suma].y<<" "<<C[S-suma].z<<"\n";
                    return 0;
                }

            }
        }
    }
    fout<<"-1";
    fout.close();
    return 0;
}