#include <fstream>
#include <algorithm>
using namespace std;
long v[101], num[6];
long n, s, solved=0;
void solve(long no, long sum)
{
    long *mid_point;
    mid_point=lower_bound(v, v+n, ((double)sum)/(6-no));
    if(no==6||solved) return;
    if((*mid_point)*(6-no)==sum)
    {
        for(long i=no; i<6; ++i) num[i]=*mid_point;
        solved=1;
        return;
    }
    if((v+n)-mid_point<mid_point-v)
        for(long *i=mid_point; i<v+n; ++i)
        {
            solve(no+1, sum-*i);
            num[no]=*i;
        }
    else
        for(long *i=mid_point; i>=v; --i)
        {
            solve(no+1, sum-*i);
            num[no]=*i;
        }
}
int main()
{
    ifstream in("loto.in");
    ofstream out("loto.out");
    in>>n>>s;
    for(long i=0; i<n; ++i)
        in>>v[i];
    sort(v, v+n);
    solve(0, s);
    if(solved)
        for(long i=0; i<6; ++i)
            out<<num[i]<<' ';
    else out<<"-1";
    in.close(); out.close();
    return 0;
}