#include <bits/stdc++.h>

using namespace std;

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

unordered_set<int>st;
int n;
int a[101];

void find_triplet (int s)
{
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=i; j++)
        {
            for (int k=1; k<=j; k++)
            {
                if (a[i] + a[j] + a[k] == s)
                {
                    out << a[i] << ' ' << a[j] << ' ' << a[k];
                    return;
                }
            }
        }
    }
}

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

    for (int i=1; i<=n; i++)
        in >> a[i];
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=i; j++)
        {
            for (int k=1; k<=j; k++)
            {
                st.insert(a[i] + a[j] + a[k]);

                if (st.count(s - a[i] - a[j] - a[k]))
                {
                    out << a[i] << ' ' << a[j] << ' ' << a[k] << ' ';
                    find_triplet(s - a[i] - a[j] - a[k]);
                    return 0;
                }
            }
        }
    }

    out << -1;

    return 0;
}