#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int sol[7],s,n,i,j,v[101],aux,st,dr,mid,x,s2;
int main()
{
    fin>>n>>s;
    for(i=0;i<n;i++)
        fin>>v[i];
    sort(v,v+n);
    for(int i1=0;i1<n;i1++){
        for(int i2=n-1;i2>=0;i2--){
            aux = v[i1]+v[i2];
            sol[1] = v[i1];
            sol[2] = v[i2];
            s2 = s - aux;
            for(i=3;i<=6;i++){
                j=i2;
                while(s2-v[j] < (i-1)*v[0] && j >= i1)
                    j--;
                if(j<i1){
                    break;
                }
                sol[i] = v[j];
                s2 -= v[j];
            }
            s2=0;
            for(i=1;i<=6;i++)
                s2 += sol[i];
            if(s == s2){
                for(i=1;i<=6;i++)
                    fout<<sol[i]<<' ';
                return 0;
            }
        }
    }
    fout<<-1;
    return 0;
}