#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;
struct elem
{
    unsigned int a, b, c;
    unsigned int s;
}x, a[1100000];
unsigned int n, y, g, m, i, j, k, s, v[105];



bool cmp(elem a, elem b)
{
    return a.s<b.s;
}

unsigned int caut(unsigned int f)
{
    unsigned int p=1,u=m;
    unsigned int sol=0;
    while(p<=u)
    {
        unsigned int mij=p+(u-p)/2;
        if(a[mij].s==f)
            return mij;
        if(a[mij].s>f) u=mij-1;
        else p=mij+1;
    }
    return 0;
}

int main()
{
    freopen("loto.in", "r", stdin);
    freopen("loto.out", "w", stdout);
    scanf("%u%u", &n, &g);
    for(i=1;i<=n;i++)
        scanf("%u", &v[i]);

    sort(v+1,v+n+1);
    for(i=1;i<=n;i++)
        for(j=i;j<=n;j++)
            for(k=1;k<=n;k++)
            {
                x.a=v[i],x.b=v[j],x.c=v[k];
                x.s=v[i]+v[j]+v[k];
                a[++m]=x;
            }

    sort(a+1, a+m+1, cmp);
    //m=a.size()-1;
    for(i=m;i>=0;i--)
    {
        x=a[i];
        s=x.s;
        y=caut(g-s);
        if(y>0)
        {
            x=a[i];
            printf("%u %u %u ", x.a, x.b, x.c);
            x=a[y];
            printf("%u %u %u ", x.a, x.b, x.c);
            return 0;
        }
    }
    printf("-1");
    return 0;
}