#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
template<C T>void pr(T a){cout<<a;ln;}
template<C T,C T2>void pr(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

void Main() {
  ll n,s;
  cin >> n >> s;
  ll a[n];
  rep(i,n) R a[i];
  map<ll,vector<vector<ll> > > m;
  int k=n/2;
  rep(t,1<<k) {
    vector<ll> v;
    ll sum=0;
    rep(i,k) {
      if(t&(1<<i)) {
        v.pb(i+1);
        sum+=a[i];
      }
    }
    m[sum].pb(v);
  }
  n-=k;
  vector<vector<ll> > ans;
  rep(t,1<<n) {
    ll sum=0;
    vector<ll> v;
    rep(i,n) {
      if(t&(1<<i)) {
        v.pb(k+i+1);
        sum+=a[k+i];
      }
    }
    vector<vector<ll> > w=m[s-sum];
    rep(i,w.size()) {
      vector<ll> x=w[i];
      rep(j,v.size()) x.pb(v[j]);
      ans.pb(x);
    }
  }
  sort(all(ans));
  rep(i,ans.size()) PR(ans[i],ans[i].size());
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}