#include <bits/stdc++.h>

using namespace std;

#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define f first
#define s second
#define pb push_back

typedef long long ll;
typedef pair<int, int> ii;

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;

const int MAX = 2e4+10;
const int MAX_CAP = 7.5e4+10;

int v[MAX], w[MAX]; // valor e peso
ii dp[2][MAX_CAP];

// DP usando os itens [l, r], com capacidade = cap
void get_dp(int x, int l, int r, int cap) {
	for (int i = 0; i <= cap; i++) dp[x][i] = {0, 0};
	for (int i = l; i <= r; i++) for (int j = cap; j >= 0; j--)
		if (j - w[i] >= 0) dp[x][j] = max(dp[x][j],
		{w[i] + dp[x][j - w[i]].f, -1+dp[x][j - w[i]].s});
}

int solve(vector<int>& ans, int l, int r, int cap) {
	if (l == r) {
		if (w[l] <= cap) {
			ans.push_back(l);
			return w[l];
		}
		return 0;
	}
	int m = (l+r)/2;
	get_dp(0, l, m, cap), get_dp(1, m+1, r, cap);
	int left_cap = -1;
	ii opt = {-INF, 0};
	for (int j = 0; j <= cap; j++) {
		ii at = {dp[0][j].f+dp[1][cap-j].f, dp[0][j].s+dp[1][cap-j].s};
		if (at > opt) opt = at, left_cap = j;
	}
	return solve(ans, l, m, left_cap) + solve(ans, m+1, r, cap - left_cap);
}

int main() {
	freopen("ghiozdan.in", "r", stdin);
	freopen("ghiozdan.out", "w", stdout);
	_
	int n, cap; cin >> n >> cap;
	for (int i = 0; i < n; i++) {
		v[i] = 1;
		cin >> w[i];
	}
	vector<int> ans;
	cout << solve(ans, 0, n-1, cap) << " ";
	cout << ans.size() << endl;

	vector<int> ret;
	for (int i : ans) ret.pb(w[i]);
	sort(ret.begin(), ret.end());
	for (int i = 0; i < ret.size(); i++) cout << ret[i] << endl;
	exit(0);
}