#include <bits/stdc++.h>

using namespace std;

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

const int DIM = 107;

unordered_map <int, vector <int> > H;
int v[DIM];

int main()
{
    int n, s;
    in >> n >> s;

    for(int i = 1; i <= n; i++)
    {
        in >> v[i];
    }

    for(int i = 1; i <= n; i++)
        if(s - v[i] >= 0)
        {
            for(int j = 1; j <= n; j++)
                if(s - v[i] - v[j] >= 0)
                {
                    for(int k = 1; k <= n; k++)
                        if(s - v[i] - v[j] - v[k] >= 0)
                        {
                            int p = v[i] + v[j] + v[k];

                            H[p] = {i, j, k};
                        }
                        else
                            break;
                }
                else
                    break;
        }
        else
            break;

    for(auto i : H)
        if(i.second.size() != 0 && H[s - i.first].size() != 0)
        {
            for(auto j : i.second)
                out << v[j] << ' ';

            for(auto j : H[s - i.first])
                out << v[j] << ' ';

            return 0;
        }

    out << -1;
}