#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,s,a[105];
map<ll,pair<pair<ll,ll>,ll>>m;
int32_t main(){
CODE_START;
ifstream cin("loto.in");
ofstream cout("loto.out");
cin>>n>>s;
for(ll i=1;i<=n;i++)
{
    cin>>a[i];
}
sort(a+1,a+n+1);
if(6*a[n]<s){
    rc("-1");
}
for(ll i=1;i<=n;i++)
{
    for(ll j=i;j<=n&&a[i]+a[j]<=s;j++)
    {
        for(ll k=j;k<=n&&a[i]+a[j]+a[k]<=s;k++)

        {
            ll nr=a[i]+a[j]+a[k];
            m[nr]={{a[i],a[j]},a[k]};
            if(m.find(s-nr)!=m.end()){
                cout<<a[i]<<' '<<a[j]<<' '<<a[k]<<' ';
                cout<<m[s-nr].f.f<<' '<<m[s-nr].f.s<<' '<<m[s-nr].s<<endl;
                return 0;
            }
        }
    }
}
rc("-1");
}