#include <stdio.h>
#include <iostream>
#define MAX 1000000

using namespace std;
int v[100], sume[MAX], a[MAX], b[MAX], c[MAX];
void My_sort(int m)
{
  int i, j, aux;

  for(i = 1; i < m; i++)
  {
    j = i;
    while(j > 0 && sume[j] < sume[j - 1])
    {
      aux = sume[j];
      sume[j] = sume[j - 1];
      sume[j - 1] = aux;
      aux = a[j];
      a[j] = a[j - 1];
      a[j - 1] = aux;
      aux = b[j];
      b[j] = b[j - 1];
      b[j - 1] = aux;
      aux = c[j];
      c[j] = c[j - 1];
      c[j - 1] = aux;
      j--;
    }
  }
}
int main()
{
  FILE *fin, *fout;
  int n, s, i, j, l, m, semafor;

  fin = fopen("loto.in", "r");
  fout = fopen("loto.out", "w");
  fscanf(fin, "%d%d", &n, &s);
  for(i = 0; i < n; i++)
    fscanf(fin, "%d", &v[i]);
  m = 0;
  for(i = 0; i < n; i++)
    for(j = 0; j < n; j++)
      for(l = 0; l < n; l++)
      {
        sume[m] = v[i] + v[j] + v[l];
        a[m] = v[i];
        b[m] = v[j];
        c[m] = v[l];
        m++;
      }
  My_sort(m);
  semafor = 0;
  i = 0;
  j = m - 1;
  while(semafor == 0 && i < m && j >= 0)
  {
    if(sume[i] + sume[j] < s)i++;
    if(sume[i] + sume[j] > s)j--;
    if(sume[i] + sume[j] == s)
    {
      fprintf(fout, "%d %d %d %d %d %d", a[i], b[i], c[i], a[j], b[j], c[j]);
      semafor = 1;
    }
  }
  if(semafor == 0)fprintf(fout, "%d", -1);
  fclose( fin );
  fclose( fout );
  return 0;
}