#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int s,n,i,i1,i2,i3,i4,i5,i6,sum,v[110],x,st,dr,mid;
int main () {
    fin>>n>>s;
    for (i=1;i<=n;i++) {
        fin>>v[i];
    }
    sort(v+1, v+n+1);
    for (i1=1;i1<=n;i1++) {
        for (i2=1;i2<=n;i2++) {
            for (i3=1;i3<=n;i3++) {
                for (i4=1;i4<=n;i4++) {
                    for (i5=1;i5<=n;i5++) {
                        sum=v[i1]+v[i2]+v[i3]+v[i4]+v[i5];
                        x=s-sum;
                        if (x>=0) {
                            i6=0;
                            st=1;
                            dr=n;
                            while (st<=dr) {
                                mid=(st+dr)/2;
                                if (v[mid]>x)
                                    dr=mid-1;
                                if (v[mid]<x)
                                    st=mid+1;
                                if (v[mid==x]) {
                                    i6=mid;
                                    break;
                                }
                            }
                            if (i6!=0) {
                                fout<<v[i1]<<" "<<v[i2]<<" "<<v[i3]<<" "<<v[i4]<<" "<<v[i5]<<" "<<v[i6];
                                return 0;
                            }
                        }
                    }
                }
            }
        }
    }
    fout<<-1;
    return 0;
}