#include <fstream>
#include <algorithm>

using namespace std;

int b[105];
int sum[1000005];
int p;
int n, s;
bool ok = 0;

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

void discover(int sum1, int sum2)
{
    bool v = 0;
    for(int i = 1; i <= n && !v; i++)
    {
        for(int j = i; j <= n && !v; j++)
        {
            for(int k = j; k <= n && !v; k++)
            {
                if(b[i] + b[j] + b[k] == sum1)
                {
                    fout << b[i] << " " << b[j] << " " << b[k] << " ";
                    v = 1;
                }
            }
        }
    }
    v = 0;
    for(int i = 1; i <= n && !v; i++)
    {
        for(int j = i; j <= n && !v; j++)
        {
            for(int k = j; k <= n && !v; k++)
            {
                if(b[i] + b[j] + b[k] == sum2)
                {
                    fout << b[i] << " " << b[j] << " " << b[k];
                    v = 1;
                }
            }
        }
    }
}

void bin_search(int s1, int s2, int st, int dr)
{
    int m = (st + dr) / 2;

    if(sum[m] == s2)
    {
        discover(s1, s2);
        ok = 1;
        return;
    }

    if(sum[m] < s2)
        st = m + 1;
    else if(sum[m] > s2)
        dr = m - 1;
    if(st <= dr && st > 0 && dr > 0)
        bin_search(s1, s2, st, dr);
}

int main()
{
    fin >> n >> s;
    for(int i = 1; i <= n; i++)
    {
        fin >> b[i];
    }

    for(int i = 1; i <= n; i++)
    {
        for(int j = i; j <= n; j++)
        {
            for(int k = j; k <= n; k++)
            {
                int suma = b[i] + b[j] + b[k];
                sum[p++] = suma;
            }
        }
    }

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

    for(int i = 0; i < p && !ok; i++)
    {
        if(s - sum[i] > 0)
            bin_search(sum[i], s - sum[i], 0, p - 1);
    }

    if(!ok)
        fout << "-1";

    return 0;
}