#include <iostream>
#include <algorithm>
using namespace std;

struct suma {
	int b1, b2, b3, sum;
}; bilete[100001]

bool comparare(suma m, suma n)
{
	return m.sum < n.sum 
}

int n, k, j, i, v[1000], ok, num = 0;
int main()
{
	cin >> n >> k;
	for (i = 1; i <= n; i++)
		cin >> v[i];
	for (i=1; i<=n; i++)
		for(j=i; j<=n; j++)
			for (k = i; k <= n; k++)
			{
				num++
				bilete[num].b1 = v[i];
				bilete[num].b2 = v[j];
				bilete[num].b3 = v[k];
				bilete[num].sum = v[i] + v[j] + v[k];
			}
	sort(finale + 1, finale + num, comparare);
	i = 0; j = num; ok = 0;
	while (i <= j)
	{
		if (bilete[i].sum + bilete[j].sum == s)
			{cout << bilete[i].b1 << " " << bilete[i].b2 << " " << bilete[i].b3 << " " << bilete[j].b1 << " " << bilete[j].b2 << " " << bilete[j].b3;
			ok = 1;
		else if (bilete[i].sum + bilete[j].sum > s)
			j--;
		else
			i++;
	}
	if (ok==0
		cout<<-1;
	return 0;


}