#include <stdio.h>
#include <algorithm>

#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a < b ? a : b)

int v[75000 + 5];
int vs[75000 + 5];
int wh[20000 + 5];

int main()
{
    FILE *in = fopen("ghiozdan.in", "r");

    int n, g;
    fscanf(in, "%d%d", &n, &g);
    int max = 0;
    for (int i = 0; i < n; i++)
        fscanf(in, "%d", &wh[i]);
    std::sort(wh, wh + n, [](int a, int b) {return a > b;});

    for (int i = 0; i < n; i++) {
        max = MIN(max, g);
        for (int j = MIN(max, g - wh[i]); j >= 0; j--)
            if (v[j] != 0 || j == 0) {
                int s = wh[i] + j;
                if (v[s] == 0) {
                    v[s] = 1 + v[j];
                    vs[s] = wh[i];
                }
                max = MAX(max, s);
            }
    }
    fclose(in);

    while(g >= 0 && v[g] == 0)
        g--;

    FILE *out = fopen("ghiozdan.out", "w");
    fprintf(out, "%d %d\n", g, v[g]);
    for (; g > 0; g -= vs[g])
        fprintf(out, "%d\n", vs[g]);
    fclose(out);
}