#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000003
#define INF 1000000000
#define LLINF 2000000000000000000LL

#define SIZE 100
#define EPS 1e-12

vector<pair<int,int> > half;
vector<vector<int> > ANS;
int cho[16];
int N,S,p[31];

void dfs1(int n,int s=0,int ch=0,int sump=0){
    
    if(s==n){
        half.push_back({sump,ch});
        return;
    }
    
    dfs1(n,s+1,ch+(1<<s),sump+p[s]);
    
    dfs1(n,s+1,ch,sump);
    
}

void dfs2(int n,int s,int ch=0,int sump=0){
    
    if(s==n){
        
        if(sump>S) return;
        
        int l=0,r=(int)half.size()-1,mid;
        
        while(l<r){
            mid = (l+r)/2;
            
            if(half[mid].first>=S-sump){
                r = mid;
            }else{
                l = mid+1;
            }
            
        }
        
        for(int i=l;;i++){
            if(half[i].first+sump==S){
                
                int CH = ch + half[i].second;
                vector<int> ans;
                
                for(int j=0;j<n;j++){
                    if(CH%2){
                        ans.push_back(j+1);
                    }
                    CH/=2;
                }
                
                ANS.push_back(ans);
                
            }else{
                return;
            }
        }
        
        
    }
    
    
    dfs2(n,s+1,ch+(1<<s),sump+p[s]);
    dfs2(n,s+1,ch,sump);
}

int main(){
    
    scanf("%d%d",&N,&S);
    
    for(int i=0;i<N;i++)
        scanf("%d",&p[i]);
    
    
    dfs1((N+1)/2);
    
    sort(half.begin(),half.end());
    
    dfs2(N,(N+1)/2);
    
    sort(ANS.begin(),ANS.end());
    
    for(int i=0;i<ANS.size();i++){
        
        for(int j=0;j<ANS[i].size();j++){
            printf(j<ANS[i].size()-1 ? "%d ":"%d\n",ANS[i][j]);
        }
    }
    
    return 0;
}