#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int v[100];
int sum[1000000];
int sol[6];
int st, dr, mid;
int main()
{
    int n, s;
    fin >> n >> s;
    for(int i=1; i<=n; i++)
    {
        fin >> v[i];
    }
    int p=0;
    for(int i1=1; i1<=n; i1++)
    {
        for(int i2=1; i2<=n; i2++)
        {
            for(int i3=1; i3<=n; i3++)
            {
                p++;
                sum[p] = v[i1]+v[i2]+v[i3];
            }
        }
    }
    sort(sum+1, sum+n*n*n+1);
    st=0; dr = n*n*n;
    while(st<dr-1)
    {
        mid=(st+dr)/2;
        if(s-1>sum[mid])
            st = mid;
        else
            dr = mid;
    }
    int g = st;
    for(int i=1; i<=g; i++)
    {
        int k=s-sum[i];
        bool ok=0;
        st = 1;
        dr = n*n*n;
        while(st<=dr)
        {
            mid=(st+dr)/2;
            if(sum[mid]==k)
            {
                ok=1;
                break;
            }
            else if(sum[mid]<k)
                st = mid+1;
            else
                dr = mid-1;
        }
        if(ok==1)
        {
            bool ok1 = 0;
            bool ok2 = 0;
            for(int i1=1; i1<=n; i1++)
            {
                for(int i2=1; i2<=n; i2++)
                {
                    for(int i3=1; i3<=n; i3++)
                    {
                        if(v[i1]+v[i2]+v[i3]==sum[i]&&ok1==0)
                        {
                            ok1 = 1;
                            sol[1] = v[i1];
                            sol[2] = v[i2];
                            sol[3] = v[i3];
                        }
                        else if(v[i1]+v[i2]+v[i3]==sum[mid]&&ok2==0)
                        {
                            ok2 = 1;
                            sol[4] = v[i1];
                            sol[5] = v[i2];
                            sol[6] = v[i3];
                        }
                    }
                }
            }
            sort(sol+1, sol+7);
            fout << sol[1] << " " << sol[2] << " " << sol[3] << " " << sol[4] << " " << sol[5] << " " << sol[6];
            return 0;
        }
    }
    fout << -1;
    return 0;
}