#include <cstdio>
#include <algorithm>
#define N 100
using namespace std;
int a[101];
int cp (int a, int b){
    if (a < b) return 0; return 1;}
int main()
{
  freopen ("loto.in", "r", stdin);
  freopen ("loto.out", "w", stdout);
  int n, i, sum,i1,j,j1,p,k;
  scanf ("%d %d",&n,&sum);
  for (i=1;i<=n;i++) scanf ("%d",&a[i]);
  sort (a+1,a+n+1,cp);
  for (i=1;i<=n && 6*a[i]>=sum;i++){
    for (j=i;j<=n;j++)
        if (a[i]+a[j]<=sum){
    for (j1=j;j1<=n;j1++)
    if (a[i]+a[j]+a[j1]<=sum){
    for (i1=j1;i1<=n;i1++){
            if (a[i]+a[i1]+a[j]+a[j1]<=sum){
    for (p=i1;p<=n;++p)
        for (k=p;k<=n;k++)
        if (a[i]+a[j]+a[i1]+a[j1]+a[p]+a[k]==sum){
            printf ("%d %d %d %d %d %d", a[k],a[p],a[i1],a[j1],a[j],a[i]); return 0;}
            }
    }
    }
        }
  }
  printf ("-1");


}