#include <bits/stdc++.h>
 
using namespace std;

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

int n,v[101],suma_scop;
	
struct hhh{
    int x, y, z;
};
 
unordered_map <int, hhh> m;
int main()
{
    f>>n>>suma_scop;
    for(int i=1;i<=n;i++)
        f>>v[i];
    for(int i=1;i<=n;i++)
        for(int j=i;j<=n;j++)
            for(int l=j;l<=n;l++)
                m[v[i]+v[j]+v[l]]= {v[i], v[j], v[l]};
    for (auto i : m)
    {
        int sum=i.second.x+i.second.y+i.second.z;
        if(m.count(suma_scop-sum))
        {
            g<<i.second.x<<" "<<i.second.y<<" "<<i.second.z<<" "<<m[suma_scop-i.first].x<<" "<<m[suma_scop-i.first].y<<" "<<m[suma_scop-i.first].z;
            return 0;
        }
    }
    g<<-1;
    return 0;
}