#include<fstream>
#include<queue>
#include<iostream>
#include<map>
#include<algorithm>
#include<unordered_map>
#include<stack>
#define DN 105
#define M 66013
#define x first
#define y second
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n,s,a[DN],sum;
unordered_map<int,int>mp1[M],mp2[M],mp3[M];
int main()
{
    fin>>n>>s;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    for(int i=1;i<=n;i++)
        for(int j=i;j<=n;j++)
            for(int h=i;h<=n;h++)
            {
                sum=a[i]+a[j]+a[h];
                if(mp1[sum%M].find(sum)!=mp1[sum%M].end())
                    continue;
                mp1[sum%M][sum]=a[i];
                mp2[sum%M][sum]=a[j];
                mp3[sum%M][sum]=a[h];
            }
    for(int i=1;i<=n;i++)
        for(int j=i;j<=n;j++)
            for(int h=i;h<=n;h++)
            {
                sum=a[i]+a[j]+a[h];
                if(s-sum<0)
                    continue;
                sum=s-sum;
                if(mp1[sum%M].find(sum)!=mp1[sum%M].end())
                {
                    fout<<a[i]<<' '<<a[j]<<' '<<a[h]<<' ';
                    fout<<mp1[sum%M][sum]<<' '<<mp2[sum%M][sum]<<' '<<mp3[sum%M][sum];
                    return 0;
                }
            }
    fout<<-1;
}