#include <bits/stdc++.h>

using namespace std;


ifstream fin ("loto.in");
ofstream fout ("loto.out");

struct tri
{
    int x,y,z;
}cont;

int a[1001];
unordered_map <int,tri> mapp;

int main()
{
    int n,s,i,j,k,suma,ok=0;
    fin>>n>>s;
    for(i=1;i<=n;++i)
    {
        fin>>a[i];
    }
    for(i=1;i<=n && ok==0;++i)
    {
        for(j=i;j<=n && ok==0;++j)
        {
            for(k=j;k<=n && ok==0;++k)
            {
                suma = a[i] + a[j] + a[k];
                if(suma < s)
                {
                    cont.x = a[i];
                    cont.y = a[j];
                    cont.z = a[k];
                    mapp[suma] = cont;
                    if(mapp.count(s-suma)!= 0)
                    {
                        ok = 1;
                        fout<<a[i]<<" "<<a[j]<<" "<<a[k]<<" ";
                        fout<<mapp[s-suma].x<<" "<<mapp[s-suma].y<<" "<<mapp[s-suma].z;
                    }
                }

            }
        }
    }
    if(ok == 0)
    {
        fout<<-1;
    }
    return 0;
}