#include <fstream>
#include <algorithm>

#define sum first.first
#define x first.second
#define y second.first
#define z second.second
using namespace std;
int n, i, j, k, t, a[103], s, st, dr, mid, q;
pair< pair<int, int>, pair<int, int> >v[1000003];
int main()
{
    ifstream fin("loto.in");
    ofstream fout("loto.out");
    fin>>n>>s;
    for(i=1;i<=n;i++)
        fin>>a[i];
    for(i=1;i<=n;i++)
        for(j=i;j<=n;j++)
            for(k=j;k<=n;k++){
                v[++t].sum=a[i]+a[j]+a[k];
                v[t].x=a[i];
                v[t].y=a[j];
                v[t].z=a[k];
            }
     sort(v+1,v+t+1);
     for(i=1;i<=t;i++){
         st=i;
         dr=t;
         q=s-v[i].sum;
         while(st<=dr){
               mid=(st+dr)/2;
               if(v[mid].sum==q){
               fout<<v[i].x<<" "<<v[i].y<<" "<<v[i].z<<" "<<v[mid].x<<" "<<v[mid].y<<" "<<v[mid].z;
               return 0;
               }
               if(v[mid].sum>q)
                  dr=mid-1;
               else
                  if(v[mid].sum<q)
                     st=mid+1;
        }
    }
    fout<<-1;
    return 0;
}