#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
struct loto
{ int sum,a,b,c;};
int ff(loto x , loto y)
{
   return x.sum<y.sum;
}
loto v[400000];
int n,s,k,i,j,o[101],nr;
int citire()
{
    f>>n>>s;
    for(i=1;i<=n;i++)
        f>>o[i];
}
int main()
{
    citire();
    for(i=1;i<=n;i++)
        for(j=i;j<=n;j++)
            for(k=j;k<=n;k++)
             {
                 v[++nr].sum=o[i]+o[j]+o[k];
                 v[nr].a=o[i];
                 v[nr].b=o[j];
                 v[nr].c=o[k];
             }
    sort(v+1,v+nr+1,ff);
    int mic=1,mare=nr;
    while(mic<=mare)
    {
        if(v[mic].sum+v[mare].sum>s)
            mare--;
            else
            if(v[mic].sum+v[mare].sum<s)
            mic++;
        else break;}
        if(mic>mare)
            g<<-1;
        else
            g<<v[mic].a<<" "<<v[mic].b<<" "<<v[mic].c<<" "<<v[mare].a<<" "<<v[mare].b<<" "<<v[mare].c;
        f.close();
        g.close();
}