#include <fstream>
#include <unordered_map>
#include <algorithm>
using namespace std;
int n,s,i,j,k,a[100];
  ifstream f("loto.in");
    ofstream g("loto.out");
    typedef struct nod {int i;int j;int k;}tip;
unordered_map<int,tip> H;
tip aux;
int main()
{f>>n>>s;
for(i=1;i<=n;i++)
    f>>a[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
{
    aux.i=i;
    aux.j=j;
    aux.k=k;
    H[a[i]+a[j]+a[k]]=aux;
    if(H.count(s-a[i]-a[j]-a[k])>0)
    {aux=H[s-a[i]-a[j]-a[k]];
    g<<a[aux.i]<<" "<<a[aux.j]<<" "<<a[aux.k]<<" "<<a[i]<<" "<<a[j]<<" "<<a[k];
    return 0;

    }
}









    return 0;
}