#include<bits/stdc++.h>
using namespace std;

typedef long long int ll;

#define EACH(v)      (v).begin(), (v).end()
#define rep(i, n)    for(int (i)=0; (i)<(n);  i++)
#define rev(i, n)    for(int (i)=(n)-1; (i)>=0; i--)
#define mp           make_pair
#define pb           push_back

#define MAX_N 50

typedef vector<long long> vl;
typedef vector<pair<long long, long long> > vll;

int n;
ll s;
ll p[MAX_N];

int main()
{
  cin >> n >> s;
  rep(i, n) cin >> p[i];

  int n1 = n/2;
  int n2 = n - n1;
  vll lsum;
  vll rsum;
  vll::iterator it;
  vl  res;

  rep(i, 1<<n1){
    ll sum = 0;
    rep(j, n1) if(i & 1 << (n1-j-1)) sum += p[j];
    lsum.pb(mp(sum, i));
  }

  rep(i, 1<<n2){
    ll sum = 0;
    rep(j, n2) if(i & 1 << (n2-j-1)) sum += p[n1 + j];
    rsum.pb(mp(sum, i));
  }

  sort(EACH(lsum));  lsum.erase(unique(EACH(lsum)), lsum.end());
  sort(EACH(rsum));  rsum.erase(unique(EACH(rsum)), rsum.end());

  rep(i, lsum.size()){
    vll::iterator st = lower_bound(EACH(rsum), mp(s-lsum[i].first,   0LL));
    vll::iterator ed = lower_bound(EACH(rsum), mp(s-lsum[i].first+1, 0LL));
    for(it=st; it!=ed; it++) res.pb(lsum[i].second * (1LL << n2) + it->second);
  }

  sort(EACH(res));   res.erase(unique(EACH(res)), res.end());

  rev(i, res.size()){
    rev(j, n) if(res[i] & 1LL << j) cout << n - j << " ";
    cout << endl;
  }

  return 0;
}