#include <fstream>
#include <algorithm>
using namespace std;
int n,sum,i,j,k,q,p,t,v[110];
int main (){
    ifstream fin ("loto.in");
    ofstream fout ("loto.out");
    fin>>n>>sum;
    for (i=1;i<=n;i++){
        fin>>v[i];
    }
    sort (v+1,v+n+1);
    for (i=1;i<=n;i++){
        for (j=1;j<=n;j++){
            for (k=1;k<=n;k++){
                for (q=1;q<=n;q++){
                    for (p=1;p<=n;p++){
                        for (t=1;t<=n;t++){
                            if (v[i]+v[j]+v[k]+v[q]+v[p]+v[t]==sum){
                                fout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[q]<<" "<<v[p]<<" "<<v[t];
                                return 0;
                            }
                        }
                    }
                }
            }
        }
    }
    fout<<-1;
}