#include <bits/stdc++.h>

using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
int n,v[105],s,cnt;
struct suma
{
    int sum,a,b,c;
}a[10000001];
bool comp( suma x, suma y)
{
    return (x.sum<y.sum);
}
int cautbin(int st,int dr,int s2)
{
    while(st<=dr)
    {
        int mid;
        mid=(st+dr)/2;
        if(a[mid].sum<s2)st=mid+1;
            else if(a[mid].sum>s2) dr=mid-1;
            else return mid;
    }
    return dr;
}
int main()
{
    in>>n>>s;
    for(int i=1;i<=n;i++)in>>v[i];
    for(int i=1;i<=n;i++)
        for(int j=i;j<=n;j++)
        for(int k=j;k<=n;k++)
        {
            int ss=0;
            ss=v[i]+v[k]+v[j];
            if(ss<s)
            {
                cnt++;
                a[cnt].sum=ss;
                a[cnt].a=v[i];
                a[cnt].b=v[j];
                a[cnt].c=v[k];
            }
        }
        sort(a+1,a+cnt+1,comp);
        int ok=0;
        int poz=1,p;
        while(poz<=cnt and ok==0)
        {
            p=cautbin(poz,cnt,s-a[poz].sum);
            if(a[poz].sum+a[p].sum==s)ok=1;
            else poz++;
        }
        if(ok==0) out<<"-1";
        else
        {
            int ans[10];
            ans[1]=a[p].a;ans[2]=a[p].b;ans[3]=a[p].c;
            ans[4]=a[poz].a;ans[5]=a[poz].b;ans[6]=a[poz].c;
            sort(ans+1,ans+7);
            for(int i=1;i<=6;i++)
                out<<ans[i]<<" ";
        }
}