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

ifstream f("loto.in");
ofstream g("loto.out");

#define cout g

int n,s;
int a[101],sol[7];
int q,nr,p,i;
void scrie(int val,int nr)
{
    for(;nr;--nr) cout<<val<<' ';
}
int main()
{
    f>>n>>s;
    for(i=0;i<n;++i) f>>a[i];
    sort(a,a+n);
    if(a[n-1]*6>=s)
    {
    q=s/6;
    nr=6;
    p=lower_bound(a,a+n,q)-a;
    while (nr*a[p]<s && nr)
    {
     s-=a[p+1];
     sol[nr]=a[p+1];
     q=s/6;
     --nr;
     p=lower_bound(a,a+n,q)-a;
    }
    if(a[p]*nr==s) {scrie(a[p],nr);
    for(++nr;nr<=6;++nr) cout<<sol[nr]<<' ';
    }
    else cout<<-1;
    }
    else cout<<-1;
    //for(i=0;i<n;++i) cout<<a[i]<<' ';
    //cout<<'\n';
    return 0;
}