#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast ios_base::sync_with_stdio(0);f.tie(0);g.tie(0);
#define setinf(x) memset(x,0x3f3f3f3f,sizeof(x));
#define set0(x) memset(x,0,sizeof(x));
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define fi first
#define se second
#define DD 100001
#define nl '\n'
using namespace std;
const string file="loto";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
unordered_map<int,tuple<int,int,int>> mp;
int n,s,v[101];
int main(){
    f>>n>>s;
    for (int i=1; i<=n; ++i) f>>v[i];
    for (int i=1; i<=n; ++i)
        for (int j=1; j<=n; ++j)
            for (int k=1; k<=n; ++k)
                mp[v[i]+v[j]+v[k]]={v[i],v[j],v[k]};
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j) {
            for (int k=1; k<=n; ++k) {
                int ss=v[i]+v[j]+v[k];
                if (mp.find(s-ss)!=mp.end()) {
                    g<<get<0>(mp[s-ss])<<" "<<get<1>(mp[s-ss])<<" "<<get<2>(mp[s-ss])<<' ';
                    g<<v[i]<<" "<<v[j]<<" "<<v[k];
                    system("pause");
                    return 0;
                }
            }
        }
    }
    g<<-1;
    system("pause");
    return 0;
}