#include <fstream>
#include <cstdio>
#include <unordered_map>
#define NR 105
#define VAL 1000005

using namespace std;

struct suma
{
    int sum;
    int a;
    int b;
    int c;
};

suma s[VAL];

int N, S, i, M, ans;
int v[NR], j, k;
bool ok;
unordered_map<int, int> ap;

int main()
{
    freopen("loto.in", "r", stdin);
    freopen("loto.out", "w", stdout);
    scanf("%d %d", &N, &S);
    for (i=1; i<=N; i++)
      scanf("%d", &v[i]);
    for (i=1; i<=N; i++)
    {
        for (j=1; j<=N; j++)
        {
            for (k=1; k<=N; k++)
            {
                s[++M].sum=v[i]+v[j]+v[k];
                ap[s[M].sum]=M;
                s[M].a=v[i];
                s[M].b=v[j];
                s[M].c=v[k];
                ans=ap[S-s[M].sum];
                if (ans>0)
                {
                    ok=true;
                    printf("%d %d %d %d %d %d\n", s[M].a, s[M].b, s[M].c, s[ans].a, s[ans].b, s[ans].c);
                    break;
                }
            }
            if (ok==true)
              break;
        }
        if (ok==true)
          break;
    }
    if (ok==false)
      printf("-1\n");
    return 0;
}