#include <fstream>
#include <algorithm> 
#include <process.h>
using namespace std;   
  
struct lala{
	int xx, y,z;
};   
typedef struct lala la;
la T[120]; 
int x[120],n,S;     
  
int main()   
{  
    ofstream fout("loto.out");  
    ifstream fin ("loto.in");   
    fin>>n>>S;   
       
    for(int i=1;i<=n;i++) 
		fin>>x[i];    
    for(int i=1;i<=n;i++)   
        for(int j=1;j<=n;j++)    
            for(int k=1;k<=n;k++)   
			{
                T[x[i]+x[j]+x[k]].xx=x[i];
				T[x[i]+x[j]+x[k]].y=x[j];
				T[x[i]+x[j]+x[k]].z=x[k];
            }   
       
    for(int i=1;i<=n;i++)   
        for(int j=1;j<=n;j++)   
            for(int k=1;k<=n;k++)   
            {     
                int v=S-(x[i]+x[j]+x[k]);   
                if(x[i]+x[j]+x[k]+T[v].xx+T[v].y+T[v].z==S)    
                {   
                fout<<x[i]<<" "<<x[j]<<" "<<x[k]<<" "<<T[v].xx<<" "<<T[v].y<<" "<<T[v].z<<"\n";   
                    exit(0);   
                }   
            }   
     fout<<"-1\n";   
	fout.close();
    return 0;   
}