#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
int v[100],S[1000000];
int main()
{
    int n,i,ns=0,s,k,j,x,l,r,m;
    in>>n>>s;
    for(i=0;i<n;i++)
        in>>v[i];
    in.close();
    for(i=0;i<n;i++)
        for (j=0;j<n;++j)
            for(k=0;k<n;++k) {
                S[ns]=(v[i]+v[j]+v[k])*1000+i*100+j*10+k;
                ++ns;
            }
    sort(S,S+ns);
    for(i=0;i<ns;i++){
        x=s-S[i]/1000;
        l=0;r=ns;
        while(l<r){
            m=(l+r)/2;
            if(S[m]/1000==x)
                break;
            if(S[m]/1000<x)
                l=m+1;
            else r=m-1;
        }
        if(l<r)
            break;
    }
    if(i==ns)
        out<<-1;
    else out<<v[S[i]/100%10]<<" "<<v[S[i]/10%10]<<" "<<v[S[i]%10]<<" "<<v[S[m]/100%10]<<" "<<v[S[m]/10%10]<<" "<<v[S[m]%10]<<" ";
    out.close();
    return 0;
}