#include <fstream>
#include<algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n,i,v[101],p,u,m,S,j,k,ci;
struct str{
    int sum,n1,n2,n3;}s[1000001];
int cmp(str a,str b)
{
   return a.sum<b.sum;

}
int main()
{
    f>>n>>S;
    int poz=0;
    for(i=1;i<=n;i++)
        f>>v[i];
    for(i=1;i<=n;i++)
        for(j=i;j<=n;j++)
            for(k=j;k<=n;k++){
                poz++;
                s[poz].sum=v[i]+v[j]+v[k];
                s[poz].n1=v[i];
                s[poz].n2=v[j];
                s[poz].n3=v[k];}
    sort(s+1,s+poz+1,cmp);
    if(s[poz].sum*2<S){
        g<<-1;
        return 0;}
    for(i=1;i<=poz;i++){
        p=1;u=poz;ci=i;
        while(p<=u){
            m=(p+u)/2;
            if(s[i].sum+s[m].sum==S){
                i=poz+10;
                break;}
            else
                if(s[i].sum+s[m].sum<S)
                    p=m+1;
                else
                    u=m-1;
        }
    }
    if(i!=poz+1)
        g<<s[ci].n1<<" "<<s[ci].n2<<" "<<s[ci].n3<<" "<<s[m].n1<<" "<<s[m].n2<<" "<<s[m].n3;
    else
        g<<-1;
    return 0;


}