#include <cstdio>
#include <algorithm>
#define oo 0x7fffffff - 2
using namespace std;

FILE *fin = freopen("ghiozdan.in", "r", stdin), *fout = freopen("ghiozdan.out", "w", stdout);

struct din
{
    int nr, prev;
} dp[75001];

int g[20001], n, G;

/*void afisare()
{
    for (int i = 0; i <= G; i++)
        fout << "(" << dp[i].nr << ", " << dp[i].prev << ") " << ' ';
    fout << '\n';
}*/

void back(int i)
{
    while (i != 0)
    {
        printf("%d\n", dp[i].prev);
        i -= dp[i].prev;
    }

}

void dinamica()
{
    for (int i = 0; i <= G; i++)
        dp[i].nr = oo;
    dp[0].nr = 0;

    for (int i = 1; i <= n; i++)
    {
        for (int j = G; j >= g[i]; j--)
        {
            int ng = j - g[i];
            if (dp[j].nr == oo && dp[ng].nr != oo)
            {
                dp[j].nr = dp[ng].nr + 1;
                dp[j].prev = g[i];
            }
        }
    }
}

bool cmp(int a, int b)
{
    return a > b;
}

int main()
{
    scanf("%d %d", &n, &G);
    for (int i = 1; i <= n; i++)
        scanf("%d", &g[i]);

    sort(g + 1 , g + n + 1, cmp);
    dinamica();

    int poz;

    for (int i = G; i >= 0; i--)
    {
        if (dp[i].nr != oo)
        {
            poz = i;
            break;
        }
    }

    printf("%d %d\n", poz, dp[poz].nr);
    back(poz);
}