#include <bits/stdc++.h>

using namespace std;

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

int n, S, v[105], sum;
unordered_map <int, pair<pair<int,int>,int>> mp;

int main()
{
    fin>>n>>S;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    for(int i=1;i<=n;i++)
        for(int j=i;j<=n;j++)
            for(int k=j;k<=n;k++)
            {
                sum=v[i]+v[j]+v[k];
                mp[sum].first.first=v[i];
                mp[sum].first.second=v[j];
                mp[sum].second=v[k];

                if(mp.find(S-sum)!=mp.end())
                {
                    fout<<mp[sum].first.first<<' '<<mp[sum].first.second<<' '<<mp[sum].second<<' ';
                    sum=S-sum;
                    fout<<mp[sum].first.first<<' '<<mp[sum].first.second<<' '<<mp[sum].second;
                    return 0;
                }

            }
    fout<<-1;
    fin.close();
    fout.close();
    return 0;
}