#include <fstream>
#include <algorithm>
using namespace std;
int a[101],v[10001];
int main()
{ int n,j,i,s,k,nr=0;
bool stop=0,ok1=0,ok2=0;
    ifstream f("loto.in");
    ofstream g("loto.out");
    f>>n>>s;
    for (i=1;i<=n;++i)
      f>>a[i];
    for (i=1;i<=n;++i)
    for (j=i;j<=n;++j)
    for (k=j;k<=n;++k) {
       ++nr;
       v[nr]=a[i]+a[j]+a[k];
    }
      sort(v+1,v+nr+1);
     int st=1,dr=nr;
     while (stop==0 && st<=dr) {
        if (v[st]+v[dr]<s) ++st;
        if (v[st]+v[dr]>s) --dr;
        if (v[st]+v[dr]==s) {
           stop=1;
           break;
        }
     }
         for (i=1;i<=n;++i)
         for (j=i;j<=n;++j)
         for (k=j;k<=n;++k) {
           if (a[i]+a[j]+a[k]==v[st] && ok1==0) {
             g<<a[i]<<" "<<a[j]<<" "<<a[k]<<" ";
              ok1=1;
           }
           if (a[i]+a[j]+a[k]==v[dr] && ok2==0) {
              g<<a[i]<<" "<<a[j]<<" "<<a[k];
              ok2=1;
           }
         }
    return 0;
}