#include <iostream>
#include <fstream>
#include <unordered_map>
#include <vector>
using namespace std;

ifstream f("loto.in");
ofstream g("loto.out");

unordered_map <int, vector<int>> sume;

vector <int> loto;

int  n, i, s, suma, k, x, j, ok;

int main()
{
    f>>n>>suma;

    for(i=0;i<n;i++)
    {
        f>>x;
        loto.push_back(x);
    }

    for(i=0;i<n;i++)
        {for(j=i;j<n;j++)
            {for(k=j;k<n;k++)
        {
            int s = loto[i]+loto[j]+loto[k];
            sume[s] = { loto[i], loto[j], loto[k] };

            if(sume.find(suma-loto[i]-loto[j]-loto[k])!=sume.end())
            {
                g<<loto[i]<<" "<<loto[j]<<" "<<loto[k]<<" "<<sume[suma-loto[i]-loto[j]-loto[k]][0]<<" "<<sume[suma-loto[i]-loto[j]-loto[k]][1]<<" "<<sume[suma-loto[i]-loto[j]-loto[k]][2];
                ok = 1; break;
            }
        }
        if(ok==1)break;
            }
           if(ok==1) break;
        }
    if(ok==0) g<<-1;
}