#include <fstream>
#include<unordered_map>

using namespace std;
int v[105];
unordered_map<int, pair<short, short>> H;

int main() {
    ifstream cin("loto.in");
    ofstream cout("loto.out");
    int n, K, ok = 0;
    cin >> n >> K;
    for (int i = 1; i <= n; i++)
        cin >> v[i];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            H[v[i] + v[j]] = {i, j};
        }
    }
    for (int i = 1; i <= n && ok == 0; i++) {
        for (int j = 1; j <= n && ok == 0; j++) {
            for (int k = 1; k <= n && ok == 0; k++) {
                for (int p = 1; p <= n && ok == 0; p++) {
                    int s = K - v[i] - v[j] - v[k] - v[p];
                    if (H[s].first != 0) {
                        cout << v[i] << " " << v[j] << " " << v[k] << " " << v[p] << " " << v[H[s].first] << " "
                             << v[H[s].second];
                        ok = 1;
                    }
                }
            }
        }
    }
    if (ok == 0)
        cout << -1;
    return 0;
}