#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
   int n,s;cin>>n>>s;
   vector<int>p(n);
   rep(i,n)cin>>p[i];
   vector<P>A,B;
   A.push_back({0,0});
   B.push_back({0,0});
   for (int i = 0; i < n/2; i++){
      int size=A.size();
      for (int j = 0; j < size; j++){
         A.push_back({A[j].first+p[i],A[j].second+(1<<i)});
      }
   }
   for (int i = n/2; i < n; i++){
      int size=B.size();
      for (int j = 0; j < size; j++){
         B.push_back({B[j].first+p[i],B[j].second+(1<<i)});
      }
   }
   sort(A.begin(),A.end());
   sort(B.begin(),B.end());
   vector<int> ans;
   for (int i = 0; i < A.size(); i++){
      vector<P>::iterator l=lower_bound(B.begin(),B.end(),make_pair(s-A[i].first,0));
      vector<P>::iterator r=lower_bound(B.begin(),B.end(),make_pair(s-A[i].first+1,0));
      for (; l < r; l++){
         ans.push_back(A[i].second+(*l).second);
      }
   }
   vector<vector<int>> res;
   rep(i,ans.size()){
      vector<int> v;
      for (int j = 0; j < p.size(); j++){
         if((ans[i]>>j)&1)v.push_back(j+1);
      }
      res.push_back(v);
   }
   sort(res.begin(),res.end());
   for (int i = 0; i < res.size(); i++){
      cout<<res[i][0];
      for (int j = 1; j < res[i].size(); j++){
         cout<<" "<<res[i][j];
      }
      cout<<endl;
   }
}