#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())




int main(){
	int n,s,p[31];
	map<int,vector<int> > mp;
	map<int,vector<int> >::iterator it;
	cin>>n>>s;
	rep(i,n)cin>>p[i];
	rep(i,1<<n/2){
		int sum=0;
		rep(j,n/2)if(i>>j&1)sum+=p[(n+1)/2+j];
		mp[sum].push_back(i);
	}
	vector<vector<int> > ans;
	rep(i,1<<(n+1)/2){
		int sum=0;
		rep(j,(n+1)/2)if(i>>j&1)sum+=p[j];
		it=mp.find(s-sum);
		if(it!=mp.end()){
			vector<int> &v=it->second;
			rep(j,v.size()){
				int bit=i|v[j]<<(n+1)/2;
				bool f=true;
				ans.push_back(vector<int>());
				rep(k,n){
					if(bit>>k&1)ans.back().push_back(k+1);
				}
			}
		}
	}
	sort(all(ans));
	rep(i,ans.size()){
		bool f=true;
		rep(j,ans[i].size()){
			if(!f)cout<<' ';
			f=false;
			cout<<ans[i][j];
		}
		cout<<endl;
	}
	return 0;
}