#include <iostream>
#include <fstream>
#define N_MAX 20001
#define G_MAX 75001
using namespace std;

ifstream fin("ghiozdan.in");
ofstream fout("ghiozdan.out");

int g[N_MAX], an[G_MAX]; 
bool af[N_MAX][G_MAX];

int main() {
	int N, G;

	fin >> N >> G;
	for (int i = 1; i <= N; i++) {
		fin >> g[i];
		for (int j = G - g[i]; j >= 0; j--) {
			if (an[j] != 0 || j == 0) {
				int k = j + g[i];

				if (an[k] == 0 || an[j] + 1 < an[k]) {
					an[k] = an[j] + 1;
					af[i][k] = true;
				}
			}
		}
	}

	int k = G;
	while (an[k] == 0)
		k--;
	fout << k << " " << an[k] << "\n";

	int o = N;
	while (k > 0) {
		while (!af[o][k])
			o--;
		fout << g[o] << "\n";
		k -= g[o--];
	}

	return 0;
	
}