#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

ll N;
ll S;
ll P[40];
map <ll,vector <vector <int> > > memo[2][2];

void dp(int k,int st,int ed){
  vector <vector <int> > init;
  init.pb({});
  memo[k][st%2][0] = init;
  //DEBUG2(st,ed);
  for(int i = st;i <= ed;i++){
    int be = i % 2;
    int now = 1-be;
    foreach(it,memo[k][be]){
      numa(x,it->sec){
        memo[k][now][it->fir].pb(x);
        x.pb(i);
        memo[k][now][it->fir+P[i]].pb(x);
      }
    }
    memo[k][be].clear();
  }
  if(sz(memo[k][0]) == 0){
    swap(memo[k][0],memo[k][1]);
  }
}

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N >> S;
  rep(i,N){
    cin >> P[i];
  }
  dp(0,0,N/2);dp(1,N/2+1,N-1);
  //DEBUG2(memo[0][0],memo[0][1]);
  //DEBUG2(memo[1][0],memo[1][1]);
  vector <vector <int> > ans_all;
  vector <int> ans;
  foreach(it,memo[0][0]){
    if(memo[1][0].find(S-it->fir) != memo[1][0].end()){
      sort(ALL(memo[0][0][it->fir]));
      sort(ALL(memo[1][0][S-it->fir]));
      numa(ar1,memo[0][0][it->fir]){
        numa(ar2,memo[1][0][S-it->fir]){
          numa(a,ar1){
            ans.pb(a+1);
          }
          numa(a,ar2){
            ans.pb(a+1);
          }
          ans_all.pb(ans);
          ans.clear();
        }
      }
    }
  }
  sort(ALL(ans_all));
  numa(ar,ans_all){
    numa(x,ar){
      cout << x << " ";
    }
    cout << endl;
  }
  return 0;
}