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

using namespace std;

int N, G, i, j;
int dp[VAL], k;
int nr[NR], x;
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", &x);
        nr[x]++;
    }
    dp[0]=1;
    for (i=NR-1; i>0; i--)
    {
        if (nr[i]>0)
        {
            for (k=G-i; k>=0; k--)
            {
                if (dp[k]!=0)
                {
                    for (j=1; j<=nr[i]; j++)
                    {
                        if (k+i*j<=G && dp[k+i*j]==0)
                        {
                            dp[k+i*j]=dp[k]+j;
                            last[k+i*j]=i;
                            mx=max(mx, k+i*j);
                        }
                        if (k+i*j>=G)
                          break;
                    }
                }
            }
        }
    }
    printf("%d %d\n", mx, dp[mx]-1);
    while (mx!=0)
    {
        printf("%d\n", last[mx]);
        mx-=last[mx];
    }
    return 0;
}