#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <queue> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> using namespace std; inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();} typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef long long LL; typedef unsigned long long ULL; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(auto i: c) #define SORT(c) sort((c).begin(),(c).end()) const double EPS = 1e-10; const double PI = acos(-1.0); #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; int main() { cin.tie(0); ios::sync_with_stdio(false); int N, S; cin >> N >> S; VI P(N); REP(i, N) cin >> P[i]; map<int, set<int>> m; m[0].insert(0); REP(i, N){ EACH(x, m){ if(x.first + P[i] > S) continue; EACH(y, x.second) if((y & (1U << i)) == 0) m[x.first + P[i]].insert(y | (1U << i)); } } VVI ret; EACH(x, m[S]){ VI tmp; REP(i, 31) if(x & (1U << i)) tmp.push_back(i + 1); ret.push_back(tmp); } SORT(ret); EACH(x, ret){ EACH(y, x) cout << y << " "; cout << endl; } return 0; }