#include <fstream>
#include <algorithm>
#include <cstdio>
#define VAL 75005
#define NR 20005

using namespace std;

int N, G, i, j;
int dp[VAL];
int nr[NR];
int last[VAL], mx;

int main()
{
    freopen("ghiozdan.in", "r", stdin);
    freopen("ghiozdan.out", "w", stdout);
    scanf("%d %d", &N, &G);
    for (i=1; i<=N; i++)
    {
        scanf("%d", &nr[i]);
        dp[nr[i]]=1;
        last[nr[i]]=nr[i];
    }
    sort(nr+1, nr+N+1);
    for (i=N; i>=1; i--)
    {
        for (j=G-nr[i]; j>0; j--)
        {
            if (dp[j]!=0)
            {
                if (dp[j+nr[i]]==0)
                {
                    dp[j+nr[i]]=dp[j]+1;
                    last[j+nr[i]]=nr[i];
                    mx=max(mx, j+nr[i]);
                }
                else
                {
                    if (dp[j+nr[i]]>dp[j]+1)
                    {
                        dp[j+nr[i]]=dp[j]+1;
                        last[j+nr[i]]=nr[i];
                        mx=max(mx, j+nr[i]);
                    }
                }
            }
        }
    }
    printf("%d %d\n", mx, dp[mx]);
    while (mx!=0)
    {
        printf("%d\n", last[mx]);
        mx-=last[mx];
    }
    return 0;
}