#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

void go(vector<pair<long long,int>> &a,long long sum,int ind,vector<int> inds,map<long long,vector<vector<int>>> &mp){
	if(ind==a.size()){
		mp[sum].push_back(inds);
		return;
	}
	go(a,sum,ind+1,inds,mp);
	inds.push_back(a[ind].second);
	go(a,sum + a[ind].first,ind+1,inds,mp);
	
}

int main(){
	
	int N;
	cin>>N;
	
	long long P;
	cin>>P;
	
	vector<pair<long long,int>> S(N);
	rep(i,N){
		cin>>S[i].first;
		S[i].second = i;;
	}
	vector<pair<long long,int>> T;
	
	while(S.size()>T.size()){
		T.push_back(S.back());
		S.pop_back();
	}
	
	map<long long,vector<vector<int>>> mp0,mp1;
	
	go(S,0,0,{},mp0);
	go(T,0,0,{},mp1);
	
	vector<vector<int>> ans;
	for(auto a:mp0){
		if(mp1.count(P - a.first)){
			auto t0 = a.second;
			auto t1 = mp1[P-a.first];
			rep(i,t0.size()){
				
				rep(j,t1.size()){
					auto temp = t0[i];
					rep(k,t1[j].size())temp.push_back(t1[j][k]);
					ans.push_back(temp);
				}
			}
		}
	}
	
	rep(i,ans.size())sort(ans[i].begin(),ans[i].end());
	
	sort(ans.begin(),ans.end());
	
	rep(i,ans.size()){
		rep(j,ans[i].size()){
			if(j!=0)cout<<' ';
			cout<<ans[i][j]+1;
		}
		cout<<endl;
	}
	
	
	return 0;
}