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

using namespace std;

ifstream fin("loto.in");
ofstream fout("loto.out");

const int NMax = 105;
struct node{
    int sum,x,y,z;
}a[NMax * NMax * NMax];
int v[NMax];

int cauta(int val,int lg){
    /*int lo = 1,hi = lg;
    while(lo <= hi){
        int mid = (lo + hi) / 2;
        if(a[mid].sum == val){
            return mid;
        }
        if(a[mid].sum > val){
            hi = mid - 1;
        } else {
            lo = mid + 1;
        }
    }
    return 0;*/
    int i, step;
    for (step = 1; step <= lg; step <<= 1);
    for (i = 1; step; step >>= 1)
        if (i + step <= lg && a[i + step].sum <= val)
           i += step;
    return i;
}

bool cmp(const node &a,const node &b){
    return(a.sum < b.sum);
}

int main()
{
    int n,s;
    fin >> n >> s;
    for(int i = 1; i <= n; i++){
        fin >> v[i];
    }
    int lg = 0;
    a[0].sum = NMax * NMax * NMax;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            for(int k = 1; k <= n; k++){
                if(v[i] + v[j] + v[k] < s){
                    lg++;
                    a[lg].sum = v[i] + v[j] + v[k];
                    a[lg].x = v[i];
                    a[lg].y = v[j];
                    a[lg].z = v[k];
                }
            }
        }
    }
    sort(a + 1, a + lg + 1, cmp);
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            for(int k = 1; k <= n; k++){
                int val = s - v[i] - v[j] - v[k];
                int poz = cauta(val,lg);
                if(a[poz].sum == val){
                    fout << a[poz].x << " " << a[poz].y << " " << a[poz].z << " " << v[i] << " " << v[j] << " " << v[k];
                    return 0;
                }
            }
        }
    }
    fout << -1;
    return 0;
}