#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
struct l
{
    int a,b,c;
};
unordered_map <int, l> qmap;
int main()
{
    int n,s;
    f>>n>>s;
    vector<int> v;
    for(int i=0;i<n;i++)
    {
        int temp;
        f>>temp;
        v.push_back(temp);
    }
    for(int i=0;i<n;i++)
        for(int j=i;j<n;j++)
            for(int k=j;k<n;k++)
            {
                l obj;
                obj.a=v[i];
                obj.b=v[j];
                obj.c=v[k];
                qmap[v[i]+v[j]+v[k]]=obj;
            }
    for(auto x:qmap)
    {
        if(qmap.find(s-x.first)!=qmap.end())
        {
            g<<x.second.a<<" "<<x.second.b<<" "<<x.second.c<<" "<<qmap[s-x.first].a<<" "<<qmap[s-x.first].b<<" "<<qmap[s-x.first].c;
            break;
        }
    }
}