#include<iostream>
#include<fstream>
#include<map>
#include<vector>
using namespace std;
int main() {
	ifstream f("loto.in");
	ofstream g("loto.out");
	int n,i,sum,x,j,k,max;
	sum = -1;
	map<int, vector<int>> m;
	f >> n>>max;
	int v[101];

	for (i = 0;i < n;i++) {
		f >> x;
		v[i] = x;
	}
	for (i = 0;i < n;i++) {
		for (j = 0;j < n;j++) {
			for (k = 0;k < n;k++) {
				m[v[i] + v[j] + v[k]] = { v[i],v[j],v[k] };
			}
		}
	}
	int q = 0;
	for (int i = 0; i < n; i++) {
		for (int j = i; j < n; j++) {
			for (int k = j; k < n; k++) {
				int sum = v[i] + v[j] + v[k];
				if (m.find(max - sum) != m.end() && (m[max - sum][0] != v[i] && m[max - sum][1] != v[j] && m[max - sum][2] != v[k])) {
					g << v[i] << " " << v[j] << " " << v[k] << " " << m[max - sum][0] << " " << m[max - sum][1] << " " << m[max - sum][2];
			}
		}
	}
}