/* -*- coding: utf-8 -*-
 *
 * 15.cc: No.15 カタログショッピング - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 31;

/* typedef */

typedef set<int> si;
typedef map<int,si> misi;

/* global variables */

int ps[MAX_N];
misi dp;

/* subroutines */

/* main */

int main() {
  int n, s;
  cin >> n >> s;
  for (int i = 0; i < n; i++) cin >> ps[i];

  dp[0].insert(0);

  for (int i = 0; i < n; i++) {
    //printf("i=%d\n", i);
    int bi = (1 << (n - 1 - i));
    for (misi::reverse_iterator mitj = dp.rbegin(); mitj != dp.rend(); mitj++) {
      int k = mitj->first + ps[i];
      if (k <= s) {
	si &bsj = mitj->second;
	si &bsk = dp[k];
	for (si::iterator sit = bsj.begin(); sit != bsj.end(); sit++)
	  bsk.insert(*sit | bi);
      }
    }
  }

  si &bs = dp[s];

  for (si::reverse_iterator sit = bs.rbegin(); sit != bs.rend(); sit++) {
    const int &bits = *sit;
    bool first = true;
    for (int i = 0, bi = (1 << (n - 1)); i < n; i++, bi >>= 1)
      if (bits & bi) {
	if (! first) putchar(' ');
	first = false;
	printf("%d", i + 1);
      }
    putchar('\n');
  }

  return 0;
}