#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
const int maxi=666013;
struct triplet
{
    int x1,x2,x3;
};
map <int,triplet> m;
map <int,triplet> :: iterator it;
int a[101],n,S;
int b[10],ct;
int main()
{
    int i,j,k,s;
triplet x;
fin>>n>>S;
for(i=1;i<=n;i++)
    fin>>a[i];
for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
        for(k=1;k<=n;k++)
        {
            s=(a[i]+a[j]+a[k])%maxi;
            x.x1=a[i];
            x.x2=a[j];
            x.x3=a[k];
            m[s]=x;
        }
int ok=1;
for(i=1;i<=n&&ok;i++)
    for(j=1;j<=n&&ok;j++)
        for(k=1;k<=n&&ok;k++)
        {
            s=a[i]+a[j]+a[k];
            int sum=S-s;
            if(sum>=0)
            {   sum=sum%maxi;
            it=m.find(sum);
            if(it!=m.end())
            {   ok=0;
                fout<<a[i]<<" "<<a[j]<<" "<<a[k]<<" "<<m[S-s].x1<<" "<<m[S-s].x2<<" "<<m[S-s].x3;
                return 0;
            }
            }
        }
fout<<-1;
    return 0;
}