#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n, S, a[101], i, b[7];
int compare(int a, int b)
{
    return a > b;
}

int main()
{
    f >> n >> S;
    int Sx = S;
    for (i = 1; i <= n; i++) f >> a[i];
    sort(a + 1, a + n + 1, compare);
    for (int j = 1; j <= n; j++)
    {
        int x = j;
        S = Sx;
        if (b[1] == 0 || b[2] == 0 || b[3] == 0 || b[4] == 0 || b[5] == 0 || b[6] == 0)
        {
            for (i = 1; i <= 6; i++) b[i] = 0;
            for (int i = 1; i <= 6; i++)
            {
                if (S - a[x] >= 0)
                {
                    S = S - a[x];
                    b[i] = a[x];
                }
                else
                {
                    x++;
                    i--;
                }
            }
        }
        else
        {
            break;
        }
    }
    for (i = 1; i <= 6; i++) g << b[i] << " ";
    f.close();
    g.close();
    return 0;
}