#include <fstream>
#include <unordered_map>
using namespace std;

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

struct suma
{
  int s;
  int a, b, c; 
};

int main()
{
  int n, s; cin >> n >> s;

  int v[101];
  for (int i = 0; i < n; ++i)
    cin >> v[i];

  suma s1;
  unordered_map<int, suma> myHash;
  for (int i = 0; i < n; ++i)
    for (int j = i; j < n; ++j)
      for (int k = j; k < n; ++k)
	{
	  s1.s = v[i] + v[j] + v[k];
	  s1.a = v[i];
	  s1.b = v[j];
	  s1.c = v[k];

	  
	  myHash[s1.s] = s1;
	}
  
  for (unordered_map<int, suma>::iterator x = myHash.begin(); x != myHash.end(); ++x)
    {
      unordered_map<int, suma>::iterator it = myHash.find(s - (*x).second.s);
      if (it != myHash.end())
		{
			suma myT = (*it).second;
			suma myS = (*x).second;

			cout << myS.a << " " << myS.b << " " << myS.c << " " << myT.a << " " << myT.b << " " << myT.c;
			return 0;
		}
    }

  cout << "Nu";  
}