/***************************************************
 * Author: Alexandru Palcuie
 * Country: Romania
 * Email: alex [dot] palcuie [at] gmail [dot] com
 * Website: http://palcu.blogspot.com/
 * Year: 2011
****************************************************/

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>

using namespace std;

typedef vector<int> VI;
typedef vector<pair<int,int> > VPI;
typedef pair<int,int> PII;
typedef long long LL;
typedef unsigned long long ULL;

//Constants
const int NMAX = 2<<7;
const int SMAX = 1111118;

//Global Vars
int n, s;
int v[NMAX];
int sum[SMAX];
int sol[SMAX][6];

//Structs

//Solve Functions
void answer(int from, int to){
        for(int i=from;i<=to;++i)
                if(sum[i] == s){
                        for(int j=0;j<6;++j)
                                printf("%d ",sol[i][j]);
                        printf("\n");
                        exit(0);
                }
        printf("-1\n");
        exit(0);
}

void rec(int k, int from, int to){
        if (k==6) answer(from, to);

        int sums, number, next = to+1, i;
        for(number=0; number<n; ++number)
                for(sums=from; sums<=to; ++sums){

                        sum[next] = sum[sums] + v[number];

                        if (sum[next] > s)
                                break;

                        for(i=0; i<k; ++i)
                                sol[next][i] = sol[sums][i];
                        sol[next][k] = v[number];


                        //debug
                        /*cerr << v[number] << " + " << sum[sums] << " = "<< sum[next] <<endl;
                        for(i=0;i<6;++i)
                                cerr<<sol[next][i] << " ";
                        cerr<<endl<<endl;*/

                        ++next;
                }
        rec(k+1, to+1, next-1);
}

int main()
{
        #ifndef ONLINE_JUDGE
        freopen("loto.in","r",stdin);
        freopen("loto.out","w",stdout);
        #endif

	scanf("%d%d",&n,&s);
	int i;

	for(i=0;i<n;++i){
                scanf("%d",&v[i]);
                sum[i] = v[i];
                sol[i][0] = v[i];
	}

	sort(v,v+n);

	//Is sum possible?
	if (v[n-1]*6 < s){
	        printf("-1\n");
	        exit(0);
	}

        rec(1,0,n-1);

        return 0;
}