#include <algorithm>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <map>
#include <queue>
#include <set>

using namespace std;

int main(){
  const int n = getInt();
  const int s = getInt();
  vector<int> p(n);
  REP(i,n) p[i] = getInt();

  map<int, vector<int> > m;

  REP(i,1<<(n/2)){
    int s = 0;
    REP(j,n/2) if(i & (1 << j)) s += p[j];
    m[s].push_back(i);
  }

  vector<vector<int> > ans;
  REP(i,1<<(n/2+n%2)){
    int t = 0;
    REP(j,n/2+n%2) if(i & (1 << j)) t += p[n/2 + j];

    if(m.count(s - t)){
      REP(j,m[s-t].size()){
        vector<int> tmp;
        const int f = m[s-t][j] | (i << (n/2));
        REP(k,n) if(f & (1 << k))
          tmp.push_back(k + 1);
        ans.push_back(tmp);
      }
    }
  }

  sort(ans.begin(), ans.end());
  REP(i,ans.size()){
    REP(j,ans[i].size()) printf("%d ", ans[i][j]);
    puts("");
  }

  return 0;
}