#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000000
//#define INF 1000000000000000000

int main(){
  int N;
  ll S;
  cin>>N>>S;
  vector<ll> P(N);
  for(int i=0;i<N;i++){
    cin>>P[i];
  }
  vector<pair<ll,int>> a;
  int m=N-N/2;
  for(int i=0;i<(1<<m);i++){
    int bit=i;
    ll sum=0;
    for(int j=0;j<m;j++){
      if(((bit>>(m-1-j))&1)==0){
        sum+=P[N/2+j];
      }
    }
    a.push_back(make_pair(sum,i));
  }
  sort(a.begin(),a.end());
  int n=N/2;
  for(int i=0;i<(1<<n);i++){
    ll sum=0;
    for(int j=0;j<n;j++){
      if(((i>>(n-1-j))&1)==0){
        sum+=P[j];
      }
    }
    int k=lower_bound(a.begin(),a.end(),make_pair(S-sum,0))-a.begin();
    while(k<a.size()&&a[k].first==S-sum){
      for(int j=0;j<n;j++){
        if(((i>>(n-1-j))&1)==0){
          cout<<j+1<<" ";
        }
      }
      for(int j=0;j<m;j++){
        if(((a[k].second>>(m-1-j))&1)==0){
          cout<<n+j+1<<" ";
        }
      }
      cout<<endl;
      k++;
    }
  }
}