#include <fstream>
using namespace std;
ifstream f("ghiozdan.in");
ofstream g("ghiozdan.out");
struct din
{
    int nr, prev;
} dp[75001];
int fr[201], n, G, x,oo,k,lim,l;
int minim(int a, int b)
{
    return a < b ? a : b;
}
void back(int i)
{
    while (i != 0)
    {
        g<<dp[i].prev<<'\n';
        i -= dp[i].prev;
    }

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

    for (int i = 200; i >= 1; i--)
    {
        if (!fr[i])
            continue;

        for (int j = G - i; j >= 0; j--)
        {
            if (dp[j].nr == oo)
                continue;

            k = 1;
            lim = minim(fr[i], (G - j) / i);
            l = j + i;
            while (dp[l].nr == oo && k <= lim)
            {
                dp[l].nr = dp[j].nr + k;
                dp[l].prev = i;
                k++;
                l += i;
            }
        }
    }
}

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

int main()
{
    oo=0x7fffffff-2;
    f>>n>>G;
    for (int i = 1; i <= n; i++)
    {
        f>>x;
        fr[x]++;
    }

    dinamica();

    int poz;

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

   g<<poz<<" "<<dp[poz].nr<<'\n';
    back(poz);
    return 0;
}