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

ifstream f("loto.in");
ofstream g("loto.out");
int i,j,k,m,n,an,bn,cn,w[200],l,i1,j1,k1,maxi;
int v[105];
int a,b,c,d,e;

bool cmp(int a,int b){return (a>b);}

int main()
{
    f>>a>>b;
    for (i=1;i<=a;++i)
    {f>>v[i];if (v[i]>maxi)maxi=v[i];}

    if (b/maxi>=3)
    sort (v+1,v+a+1,cmp);
    else sort (v+1,v+a+1);

    for (i=1;i<=a;++i)
    for (j=1;j<=a;++j)
    for (k=1;k<=a;++k)
    for (i1=1;i1<=a;++i1)
    for (j1=1;j1<=a;++j1)
    if (binary_search(v+1,v+a+1,b-v[i]+v[j]+v[k]+v[i1]+v[j1]+v[k1]))
    {
        g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[i1]<<" "<<v[j1]<<" "<<lower_bound(v+1,v+a+1,b-v[i]+v[j]+v[k]+v[i1]+v[j1]+v[k1])<<'\n';
        return 0;
    }
g<<-1<<'\n';


    return 0;
}