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

struct asd
{
   int a,b,c,sum;
}s[400000];

bool comp(asd a,asd b)
{
    return a.sum<b.sum;
}

int main()
{
    freopen("loto.in","r",stdin);
    freopen("loto.out","w",stdout);
    int sum,n,v[109],nr=0;
    scanf("%d %d",&n,&sum);
    for(int i=1;i<=n;++i)
        scanf("%d",&v[i]);
    for(int i=1;i<=n;++i)
        for(int j=i;j<=n;++j)
            for(int k=j;k<=n;++k)
            {
                s[++nr].sum=v[i]+v[j]+v[k];
                s[nr].a=v[i],s[nr].b=v[j],s[nr].c=v[k];
            }
    int high=nr,low=1;
    while(low<=high)
    {
        if((s[low].sum+s[high].sum)>sum)
            high--;
        else if(s[low].sum+s[high].sum<sum)
            low++;
        else
            break;
    }
    if(low>high)
        printf("-1");
    else
        printf("%d %d %d %d %d %d",s[low].a,s[low].b,s[low].c,s[high].a,s[high].b,s[high].c);

    fclose(stdin);
    fclose(stdout);
    return 0;
}