#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
struct Trio
{
    int x,y,z;
    friend ostream& operator<<(ostream& out,const Trio& a){
    out<<a.x<<" "<<a.y<<" "<<a.z;
    }
};
ifstream f("loto.in");
ofstream g("loto.out");
int main()
{
    int n,s,v[101];
    unordered_map<int, Trio> dictionar;
    f>>n>>s;

    for(int i=0; i<n; i++)
        f>>v[i];

    for (int i=0; i<n; i++)
    {
        for(int j=i; j<n; j++)
        {
            for(int k=j; k<n; k++)
            {
                Trio a;
                a.x=v[i];
                a.y=v[j];
                a.z=v[k];
                int suma=v[i]+v[j]+v[k];
                dictionar[suma]=a;
                 if(dictionar.find(s-suma)!=dictionar.end())
                {
                    g<<dictionar[suma]<<" "<<dictionar[s-suma];
                    return 0;
                }
            }
        }
    }
    g<<-1;
    return 0;
}