#include <stdio.h>
#include <algorithm>
using namespace std;
struct merg
{
    int s,a,b,c;
};
bool cmp(merg x1,merg x2)
{
  return x1.s<x2.s;
}
int v[101];
merg sol[1000001];
int main()
{
    FILE *fin,*fout;
    int n,m,i,nr,k,x,y,st,dr,ok;
    fin=fopen("loto.in","r");
    fout=fopen("loto.out","w");
    fscanf(fin,"%d%d",&n,&m);
    for(i=1;i<=n;i++){
        fscanf(fin,"%d",&nr);
        v[i]=nr;
    }
    k=1;
    for(i=1;i<=n;i++)
        for(x=1;x<=n;x++)
            for(y=1;y<=n;y++)
            {
                sol[k].s=v[i]+v[y]+v[x];
                sol[k].a=v[i];
                sol[k].b=v[y];
                sol[k].c=v[x];
                k++;
            }
    n=n*n*n;
    sort(sol+1,sol+n+1,cmp);
    ok=0;
    st=1;
    dr=n;
    while(st<=dr&&ok==0)
    {
        if(sol[st].s+sol[dr].s<=m)
        {
          if(sol[st].s+sol[dr].s==m)
            ok=1;
          else
            st++;
        }
        else
          dr--;
    }
    if(ok==1)
      fprintf(fout,"%d %d %d %d %d %d\n",sol[st].a,sol[st].b,sol[st].c,sol[dr].a,sol[dr].b,sol[dr].c);
    else
      fprintf(fout,"-1");
    fclose(fin);
    fclose(fout);
}