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

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(int *x, int *y){reader(x);reader(y);}
void reader(int *x, int *y, int *z){reader(x);reader(y);reader(z);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}

template<class T> void sort(int N, T a[], void *mem = NULL){sort(a,a+N);}
template<class T1, class T2> void sort(int N, T1 a[], T2 b[], void *mem){int i;pair<T1,T2> *r=(pair<T1, T2>*)mem;rep(i,N)r[i].first=a[i],r[i].second=b[i];sort(r,r+N);rep(i,N)a[i]=r[i].first,b[i]=r[i].second;}
template<class T1, class T2, class T3> void sort(int N, T1 a[], T2 b[], T3 c[], void *mem){int i;pair<T1,pair<T2,T3> > *r=(pair<T1,pair<T2,T3> >*)mem;rep(i,N)r[i].first=a[i],r[i].second.first=b[i],r[i].second.second=c[i];sort(r,r+N);rep(i,N)a[i]=r[i].first,b[i]=r[i].second.first,c[i]=r[i].second.second;}
template<class T1, class T2, class T3, class T4> void sort(int N, T1 a[], T2 b[], T3 c[], T4 d[], void *mem){int i;pair<pair<T1,T2>,pair<T3,T4> > *r=(pair<pair<T1,T2>,pair<T3,T4> >*)mem;rep(i,N)r[i].first.first=a[i],r[i].first.second=b[i],r[i].second.first=c[i],r[i].second.second=d[i];sort(r,r+N);rep(i,N)a[i]=r[i].first.first,b[i]=r[i].first.second,c[i]=r[i].second.first,d[i]=r[i].second.second;}

int cost[99999];
int mask1[99999], cost1[99999];
int mask2[99999], cost2[99999];

int ress, res[1000000];
int arr[33], ars;

int main(){
  int i, j, k, N, S, P[33];
  int n1, n2, x;
  int res[33], ress;
  void *mem = malloc(10000000);

  reader(&N,&S);
  rep(i,N) reader(P+i);

  n1 = N/2;
  n2 = N - n1;
  mask1[0] = mask2[0] = cost1[0] = cost2[0] = 0;

  rep(i,n1) cost[1<<i] = P[i];
  REP(i,1,1<<n1) mask1[i] = i, cost1[i] = cost1[i&(i-1)] + cost[i^(i&(i-1))];
  rep(i,n2) cost[1<<i] = P[n1+i];
  REP(i,1,1<<n2) mask2[i] = i, cost2[i] = cost2[i&(i-1)] + cost[i^(i&(i-1))];

  sort(1<<n1, cost1, mask1, mem);
  sort(1<<n2, cost2, mask2, mem);

  ress = 0;
  rep(i,1<<n1){
    j = lower_bound(cost2, cost2+(1<<n2), S-cost1[i]) - cost2;
    while(j < (1<<n2) && cost1[i]+cost2[j]==S){
      x = 0;
      rep(k,n1) if(mask1[i]&1<<k) x |= 1<<(30-k);
      rep(k,n2) if(mask2[j]&1<<k) x |= 1<<(30-n1-k);
      res[ress++] = x;
      j++;
    }
  }

  sort(res, res+ress);
  reverse(res, res+ress);
  rep(i,ress){
    ars = 0;
    rep(j,N) if(res[i]&1<<(30-j)) arr[ars++] = j+1;
    rep(j,ars) writer(arr[j],j==ars-1?'\n':' ');
  }
  
  return 0;
}