#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

int n, st[7], v[101], s;
bool found;

void process(int k){
    if(found) return;

    for(int i = 1; i <= n && !found; ++i){
        st[k] = v[i];

        int sum = 0;
        for(int j = 1; j <= k; ++j)
            sum += st[j];

        if(k == 6){
            if(sum == s){
                found = true;
            }
        } else {
            if(sum >= s){
                break;
            }
            process(k + 1);
        }
    }
}

int main()
{
    ifstream cin("loto.in");
    ofstream cout("loto.out");
    int i;
    cin>>n>>s;

    for(i = 1; i <= n; ++i)
        cin>>v[i];

    sort(v + 1, v + n + 1);

    process(1);
    if(!found)
        cout<<-1;
    else
        for(int i = 1; i <= 6; ++i)
            cout<<st[i]<<" ";

    return 0;
}