#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
FILE *f, *g;
int vec[101];
int S;
int N;
struct suma{
    int i;
    int j;
    int k;
    int sum;
};
suma v[1000001];
int index, size;
int ok;

int compare(suma a,suma b)
{
    return (a.sum<b.sum);
}

int main()
{
    f = fopen("loto.in", "r");
    g = fopen("loto.out", "w");

    fscanf(f, "%d", &N);
    fscanf(f, "%d", &S);

    for(int i = 1; i <= N; i++)
        fscanf(f, "%d", &vec[i]);

    index = 1;

    for(int i = 1; i <= N; i++)
        for(int j = i; j <= N; j++)
            for(int k = j; k <= N; k++)
            {
                v[index].i=vec[i];
                v[index].j=vec[j];
                v[index].k=vec[k];
                v[index].sum=vec[i]+vec[j]+vec[k];
                index++;
            }

    size = index - 1;

    // sort
    sort(v + 1, v + 1 + size, compare);

    ok = 1;

    for(int i = 1; i <= size; i++)
    {
        int sum = S - v[i].sum;
        int a = 1;
        int b = size;

        for(;a<=b&&ok;)
        {
            int middle = (a+b) / 2;
            if(v[middle].sum == sum)
            {
                fprintf(g, "%d %d %d %d %d %d", v[i].i, v[i].j, v[i].k, v[middle].i, v[middle].j, v[middle].k);
                ok = 0;
            }
            if(v[middle].sum > sum)
                b = middle - 1;
            if(v[middle].sum < sum)
                a = middle + 1;
        }
    }

    if(ok)
        fprintf(g, "-1");

    fclose(f);
    fclose(g);
    return 0;
}