#include<bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int n;
ll s, p[40];

int main(){
	cin >> n >> s;
	rep(i, n) cin >> p[i];
	
	if(n == 1){
		if(p[0] == s) cout << 1 << endl;
		return 0;
	}
	
	int m = n / 2;
	unordered_map<ll, vi> lst;
	vector<vi> ans;
	
	rep(i, 1 << m){
		
		ll sum = 0;
		rep(j, m) if(i & 1 << j) sum += p[j];
		lst[sum].pb(i);
	}
	
	rep(i, 1 << (n - m)){
		
		ll sum = 0;
		rep(j, n - m) if(i & 1 << j) sum += p[j + m];
		each(j, lst[s - sum]){
			
			vi v;
			rep(k, m) if(*j & 1 << k) v.pb(k + 1);
			rep(k, n - m) if(i & 1 << k) v.pb(k + m + 1);
			ans.pb(v);
		}
	}
	sort(all(ans));
	each(i, ans){
		rep(j, i->size()) printf("%d%c", (*i)[j], j==i->size()-1?'\n':' ');
	}
	
	return 0;
}