#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n,S,p,a[101],v[1000001],st,dr,m;
void afis(int s) {
    for (int i=1;i<=n;++i) for (int j=1;j<=n;++j) for (int k=1;k<=n;++k) if (a[i]+a[j]+a[k]==s) {
        g<<a[i]<<' '<<a[j]<<' '<<a[k];
        return;
    }
}
int main()
{
    f>>n>>S;
    for (int i=1;i<=n;++i) f>>a[i];
    for (int i=1;i<=n;++i) for (int j=1;j<=n;++j) for (int k=1;k<=n;++k) v[++p]= a[i]+a[j]+a[k];
    sort(v+1,v+p+1);
    for (int i=1;i<=p;i++) {
        st=1, dr=p;
        while (st<=dr) {
            m=(st+dr)/2;
            if (v[m]==S-v[i]) {
                afis(v[i]);
                g<<' ';
                afis(v[m]);
                g<<'\n';
                exit(0);
            }
            if (v[m]<S-v[i]) st=m+1;
            else dr=m-1;
        }
    }
    g<<"-1\n";
    return 0;
}