#include <cstdio>
#include <unordered_map>

using namespace std;

struct pereche {
    int i = -1;
    int j = -1;
    int k = -1;
    int sum = 0;
};

unordered_map<int, pereche> mp;

int main() {
    freopen("loto.in", "r", stdin);
    freopen("loto.out", "w", stdout);

    int N, S;
    int nr[101];

    scanf("%d %d", &N, &S);
    for (int i = 1; i <= N; i++) {
        scanf("%d", &nr[i]);
    }

    for (int i = 1; i <= N; i++)
        for (int j = 1; j <= N; j++)
            for (int k = 1; k <= N; k++) {
                pereche p;
                p.i = nr[i];
                p.j = nr[j];
                p.k = nr[k];
                p.sum = nr[i] + nr[j] + nr[k];
                mp[p.sum] = p;
            }

    for (auto &entry : mp) {
        int sum = entry.second.sum;
        int sn = S - sum;
        if (mp[sn].i != -1) {
            {
                printf("%d %d %d ", entry.second.i, entry.second.j,
                       entry.second.k);
                printf("%d %d %d\n", mp[sn].i, mp[sn].j, mp[sn].k);
                return 0;
            }
        }
    }

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