#include <stdio.h>
#include <stdlib.h>

int n;
long int s, a[101];

void quickSort(int left, int right)
{
      int i = left, j = right;
      long int tmp;
      int pivot = a[(left + right) / 2];
      while(i <= j)
      {
        while (a[i] < pivot) i++;
        while (a[j] > pivot) j--;
        if (i <= j)
        {
         tmp = a[i];
         a[i] = a[j];
         a[j] = tmp;
         i++;
         j--;
        }
      }
      if (left < j) quickSort(left, j);
      if (i < right) quickSort(i, right);
}

int main()
{
    int i, j, k, x, y, z;
    freopen("loto.in","r",stdin);
    freopen("loto.out","w",stdout);
    scanf("%d %ld",&n,&s);
    for (i = 1; i <= n; i++)
        scanf("%ld",&a[i]);
    quickSort(1,n);
    for (i = 1; i <= n; i++)
    for (j = 1; j <= n; j++)
    for (k = 1; k <= n; k++)
    for (x = 1; x <= n; x++)
    for (y = 1; y <= n; y++)
    for (z = 1; z <= n; z++)
        if (a[i] + a[j] + a[k] + a[x] + a[y] + a[z] == s)
        {
            printf("%ld %ld %ld %ld %ld %ld\n",a[i],a[j],a[k],a[x],a[y],a[z]);
            exit(1);
        }
    printf("-1\n");
    return 0;
}