#include <fstream>
#include <algorithm>
#include <iostream>

using namespace std;

int n, s;
int v[100];
int solutie[6];
int k;

int main() {
    ifstream in("loto.in");
    ofstream out("loto.out");

    in >> n >> s;

    int i = 0;
    for (int j = 0; j < n; ++j) {
        int x;
        in >> x;

        // Daca este mai mare decat S,
        // sigur nu intra in suma
        if (x <= s) {
            v[i++] = x;
        }
    }

    for (int i = 1; i < n; ++i) {
        int vi = v[i];
        for (int j = 0; j < n; ++j) {
            int vj = v[j];
            for (int k = 0; k < n; ++k) {
                int vk = v[k];
                for (int x = 0; x < n; ++x) {
                    int vx = v[x];
                    for (int y = 0; y < n; ++y) {
                        int vy = v[y];
                        for (int z = 0; z < n; ++z) {
                            int vz = v[z];
                            if (vi + vj + vk + vx + vy + vz == s) {
                                out << vi << ' ' << vj << ' ' << vk << ' '
                                    << vx << ' ' << vy << ' ' << vz << '\n';
                                return 0;
                            }
                        }
                    }
                }
            }
        }
    }

    out << -1;
}