#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
 {
     ifstream f("loto.in");
     ofstream g("loto.out");
     short n;
     int s;
     f>>n>>s;
     vector<short> x(n); sort(x.begin(),x.end());
     for(short i=0;i<n;i++) f>>x[i];

    int sum=0;

    for(short u=0;u<n;u++){
        if(sum>s) break;
        sum+=x[u];
        for(short j=0;j<n;j++){
            if(sum>s) break;
            sum+=x[j];
            for(short k=0;k<n;k++){
                if(sum>s) break;
                sum+=x[k];
                for(short l=0;l<n;l++){
                    if(sum>s) break;
                    sum+=x[l];
                    for(short m=0;m<n;m++){
                        if(sum>s) break;
                        sum+=x[m];
                        for(short o=0;o<n;o++){
                            if(sum>s) break;
                            sum+=x[o];
                            if(sum==s){
                                g<<x[u]<<' '<<x[j]<<' '<<x[k]<<' '<<x[l]<<' '<<x[m]<<' '<<x[o];
                                return 0;
                            }
                            sum-=x[o];
                        }
                        sum-=x[m];
                    }
                    sum-=x[l];
                }
                sum-=x[k];
            }
            sum-=x[j];
        }
        sum-=x[u];
    }
    g<<"-1\n";
    return 0;
}