#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#ifdef __LOCAL
 #include <debug>
#else
 #define debug(...) void(0)
#endif

#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()

template<typename T>
istream& operator>>(istream&is,vector<T>&v){
  for(T&p:v)is>>p;
  return is;
}
template<typename T>
ostream& operator<<(ostream&os,const vector<T>&v){
  if(&os==&cerr)os<<"[";
  for(int i=0;i<v.size();i++){
    os<<v[i];
    if(i+1<v.size())os<<(&os==&cerr?",":" ");
  }
  if(&os==&cerr)os<<"]";
  return os;
}

bool in(const long long S,const int a){
  return (S>>a)&1;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n,s;cin>>n>>s;
  int N=n/2;
  vector<int> p(N),q(n-N);
  REP(i,n)
    if(i<N)cin>>p[i];
    else cin>>q[i-N];
  
  map<int,vector<int>> P;
  REP(S,1<<N){
    int sum=0;
    REP(i,N)if(in(S,i))sum+=p[i];
    P[sum].push_back(S);
  }

  vector<vector<int>> ans;
  REP(T,1<<(n-N)){
    int sum=0;
    REP(i,n-N)if(in(T,i))sum+=q[i];
    if(!P.count(s-sum))continue;
    for(int S:P[s-sum]){
      vector<int> v;
      REP(i,N)if(in(S,i))v.push_back(i+1);
      REP(i,n-N)if(in(T,i))v.push_back(N+i+1);
      ans.push_back(v);
    }
  }
  sort(ALL(ans));
  for(const auto&ve:ans)cout<<ve<<"\n";
}