#include <unordered_map>
#include <fstream>

using namespace std;

ifstream cin ("loto.in");
ofstream cout ("loto.out");

int v[101],n,S;

struct str{
int a,b,c;
};
unordered_map<int,str>M;

int main() {
	cin>>n>>S;
	for (int i=1;i<=n;i++)
		cin >> v[i];
	for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			for (int k=1;k<=n;k++) {
				int s=v[i]+v[j]+v[k];
				M[s]={v[i],v[j],v[k]};
				if (M.find(S-s)!= M.end()){
					cout <<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[S-s].a<<" "<<v[S-s].b<<" "<<v[S-s].c;
					return 0;
				}
			}
	cout<<-1;
}