#include <cstdio>
#include <algorithm>

using namespace std;
int n,s,v[101],i,a[7],k;
long long suma,restsuma;

int main()
{
    freopen("loto.in","r",stdin);
    freopen("loto.out","w",stdout);
    scanf("%d%d",&n,&s);
    for (i=1; i<=n; i++) scanf("%d",&v[i]);
    sort(v+1,v+n+1);
    suma=6*v[1];
    restsuma=s-suma;
    if ((restsuma<0) or (6*v[n]<s)) printf("-1");
    else
    {
        for (i=1; i<=6; i++) a[i]=v[1];
        i=6;
        k=2;
        while (restsuma>0)
        {
            restsuma=restsuma-v[k]+a[i];
            a[i]=v[k];
            k++;
            if (k==n+1)
            {
                k=2;
                i--;
            }
        }
        if (restsuma!=0) printf("-1");
    }
    if (restsuma==0) for (i=1; i<=6; i++) printf("%d ",a[i]);
    return 0;
}