#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <fstream>
#include <cstdio>

using namespace std;

const int N = 2000;
int c[N];
int can[N][N];

int main() {
	int n, give;
	cin >> n >> give;
	for (int i = 0; i < n; i++) {
		cin >> c[i];
	}
	can[0][0] = 1;
	//for (int i = 0; i <= give; i++)
//		can[i][0] = 1;
	for (int i = 0; i < n; i++) {
		for (int w = give; w >= 0; w--) {
			for (int k = 0; k <= give; k++) {
				/*if (can[w][k]) {
					cout << w << " " << k << " " << c[i] << endl;
				}*/
				if (can[w][k] == 1) can[w + c[i]][k] = 1;
				if (can[w][k] == 1) can[w + c[i]][k + c[i]] = 1;
			}
		}
	}

	/*for (int i = 0; i <= give; i++) {
		for (int k = 0; k <= give; k++) {
			if (can[i][k]) {
				cout << i << " " << k << endl;
			}
		}
	}*/

	int cnt = 0;
	for (int k = 0; k <= give; k++) {
		if (can[give][k]) cnt++;
	}
	cout << cnt << endl;
	for (int k = 0; k <= give; k++) {
		if (can[give][k]) {
			cout << k << " ";
		}
	}
	return 0;
}