#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>

using namespace std;
int main(){
  int N,S;
  scanf("%d%d",&N,&S);
  int P[N];
  for( int i = 0 ; i <N; i++) scanf("%d", &P[i]);
  int sum=0;
  for( int i = 0 ; i <N; i++ ) sum+=P[i];
  int rest[N+1];
  int minVal[N+1];
  rest[N]=0;
  minVal[N]= INT_MAX;
  for( int i = N-1; i>=0 ;i--){
    rest[i] = rest[i+1]+P[i];
    minVal[i] = min(minVal[i+1],P[i]);
  }
  queue< pair<int,vector<int> > > q;
  vector< vector<int> > ans;
  q.push( make_pair( 0,vector<int>() ) );
  for( int i = 0 ; i <N; i++ ){
    int size = q.size();
    for( int j = 0 ; j < size; j++){
      pair<int,vector<int> > p = q.front();
      vector<int> seq = p.second;
      int cost = p.first;
      q.pop();
      
      if( cost+minVal[i+1] <= S && cost + rest[i+1] >= S ){
        q.push( make_pair( cost, seq ) );
      }
      cost += P[i];
      seq.push_back(i);
      if( cost == S ){
        ans.push_back(seq);
      }
      if( cost+minVal[i+1] <= S && cost + rest[i+1] >= S ){
        q.push( make_pair( cost, seq ) );
      }
    }
  }
  sort(ans.begin(),ans.end());
  for( int i = 0 ; i < (int)ans.size(); i++){
    for( int j = 0 ; j < (int)ans[i].size(); j++ ){
      cout << 1+ans[i][j]<<" ";
    }
    cout << endl;
  }
  return 0;
}