#include <bits/stdc++.h>

using namespace std;

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

int n, g;
int count_w[205];
int dp[75005];
int used[75005];
short items_taken[205][75005];

int main() {
    fin >> n >> g;
    
    for (int i = 1; i <= n; ++i) {
        int w;
        fin >> w;
        count_w[w]++;
    }
    fin.close();
    
    for (int j = 1; j <= g; ++j) {
        dp[j] = 1e9;
    }
    dp[0] = 0;
    
    for (int w = 1; w <= 200; ++w) {
        if (count_w[w] == 0) continue;
        
        for (int j = 0; j <= g; ++j) {
            used[j] = 0;
        }
        
        for (int j = w; j <= g; ++j) {
            if (dp[j - w] != 1e9) {
                if (used[j - w] < count_w[w]) {
                    if (dp[j - w] + 1 < dp[j]) {
                        dp[j] = dp[j - w] + 1;
                        used[j] = used[j - w] + 1;
                        items_taken[w][j] = used[j];
                    } else if (dp[j - w] + 1 == dp[j]) {
                        if (used[j - w] + 1 < used[j]) {
                            used[j] = used[j - w] + 1;
                            items_taken[w][j] = used[j];
                        }
                    }
                }
            }
        }
    }
    
    int best_g = 0;
    for (int j = g; j >= 0; --j) {
        if (dp[j] != 1e9) {
            best_g = j;
            break;
        }
    }
    
    fout << best_g << " " << dp[best_g] << "\n";
    
    int curr_j = best_g;
    for (int w = 200; w >= 1; --w) {
        if (count_w[w] == 0) continue;
        
        int take_count = items_taken[w][curr_j];
        for (int k = 0; k < take_count; ++k) {
            fout << w << "\n";
        }
        curr_j -= take_count * w;
    }
    
    return 0;
}