#include<cstdio>
#include<unordered_map>

using namespace std;

int v[101], n, m, s;

struct loto
{
    int t1, t2, t3;
}X;

unordered_map <int, loto> kush;

int main()
{
    freopen("loto.in", "rt", stdin);
    freopen("loto.out", "wt", stdout);

    scanf("%d %d",&n,&s);

    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)
                {
                    int s1;
                    s1=v[i]+v[j]+v[k]; X=v[i]+v[j]+v[k]; X.t1=v[i]; X.t2=v[j]; X.t3=v[k];
                    kush[s1]=X;
                    if(kush.find(s-s1)!=kush.end())
                    {
                        printf("%d %d %d ", v[i], v[j], v[k]);
                        printf("%d %d %d\n", kush[s-s1].t1, kush[s-s1].t2, kush[s-s1].t3);
                        return 0;
                    }
                }

    printf("-1");
    return 0;
}