#include <iostream>
#include <fstream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f ("loto.in");
ofstream g ("loto.out");

int main()
{
    int N,S,i,j,k,l,m,n;
    f>>N>>S;
    vector <int> v(N);
    for (i=0; i<N; i++)
        f>>v[i];
    sort(v.begin(),v.end());
    for (i=0; i<N; i++)
        for (j=i; j<N; j++)
            for (k=j; k<N; k++)
                for (l=k; l<N; l++)
                    for (m=l; m<N; m++)
                        for (n=m; n<N; n++)
                            if (v[i]+v[j]+v[k]+v[l]+v[m]+v[n]==S)
                            {
                                g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[l]<<" "<<v[m]<<" "<<v[n];
                                return 0;
                            }
    g<<-1;
}