#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n, s, p[31];
map<int, sl> mp1, mp2;

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> s;
  FOR(i, 0, n) cin >> p[i];
  mp1[0] = sl();
  mp1[0].insert(0);
  int m = n/2;
  FOR(i, n-m, n){
    each(itr, mp1){
      if(mp2.find(itr->fi) == mp2.end()) mp2[itr->fi] = sl();
      if(mp2.find(itr->fi+p[i]) == mp2.end()) mp2[itr->fi + p[i]] = sl();
      each(itrr, itr->se){
        mp2[itr->fi+p[i]].insert(*itrr + (1ll<<i));
        mp2[itr->fi].insert(*itrr);
      }
    }
    swap(mp1, mp2);
  }
  ll t;
  vvl ans;
  FORR(i, (1<<(n-m))-1, 0){
    t = 0;
    FOR(j, 0, n-m)if(((1<<j)&i)>0) t += p[j];
    if(mp1.find(s-t) != mp1.end())each(itr, mp1[s-t]){
      vl _ans;
      FOR(j, 0, n)if(((1<<j)&(*itr+i))>0) _ans.pb(j+1);
      ans.pb(_ans);
    }
  }
  sort(rng(ans), [](vl&a, vl&b){
      FOR(i, 0, min(sz(a), sz(b))) if(a[i] != b[i]) return a[i] < b[i];
      return true;
  });
  each(itr, ans) cout << join(*itr) << endl;
  return 0;
}