#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
#define MAX 103
int a[MAX];
struct cal{
    int suma,nr1,nr2,nr3;
}v[MAX*MAX*MAX];


int main()
{
    int n, s, k = 1;
    fin >> n >> s;
    for(int i = 1; i<=n; i++)
        fin >> a[i];
    sort(a+1,a+n+1);
    for(int i = 1; i<=n; i++)
        for(int j = 1; j<=n; j++)
            for(int z = 1; z<=n; z++) {
                v[k].suma= a[i] + a[j] + a[z];
                v[k].nr1=a[i];
                v[k].nr2=a[j];
                v[k].nr3=a[z];
                k++;
        }
    k--;
    for(int i = 1; i<=k; i++)
        for(int j = k; j>=i; j--)
        {

            if(s-v[j].suma==v[i].suma)
                {
                   fout << v[i].nr1 << " " << v[i].nr2 << " " << v[i].nr3 << " " << v[j].nr1 << " " << v[j].nr2 << " " << v[j].nr3 << "\n";
                return 0;
                }

        }
    fout << -1 << "\n";
    return 0;
}