#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

void solve(const vector<int>& a, vector<pair<int, int> >& v)
{
    int n = a.size();
    v.resize(1 << n);
    for(int i=0; i<(1<<n); ++i){
        bitset<32> bs(i);
        int sum = 0;
        for(int j=0; j<n; ++j){
            if(bs[j])
                sum += a[j];
        }
        v[i] = make_pair(sum, i);
    }
}

int main()
{
    int n, s;
    cin >> n >> s;
    vector<int> v(n);
    for(int i=0; i<n; ++i)
        cin >> v[i];
    reverse(v.begin(), v.end());

    vector<int> a(n/2), b((n+1)/2);
    for(int i=0; i<n/2; ++i)
        a[i] = v[i];
    for(int i=0; i<(n+1)/2; ++i)
        b[i] = v[n/2+i];

    vector<pair<int, int> > x, y;
    solve(a, x);
    solve(b, y);
    sort(x.begin(), x.end());
    sort(y.rbegin(), y.rend());
    
    unsigned j = 0;
    vector<int> ret;
    for(unsigned i=0; i<x.size(); ++i){
        while(j > 0 && x[i].first + y[j-1].first == s)
            -- j;
        while(j < y.size() && x[i].first + y[j].first >= s){
            if(x[i].first + y[j].first == s)
                ret.push_back(x[i].second | (y[j].second << (n / 2)));
            ++ j;
        }
    }

    sort(ret.rbegin(), ret.rend());
    for(unsigned i=0; i<ret.size(); ++i){
        bitset<32> bs(ret[i]);
        bool isFirst = true;
        for(int j=n-1; j>=0; --j){
            if(bs[j]){
                if(isFirst)
                    isFirst = false;
                else
                    cout << ' ';
                cout << (n - j);
            }
        }
        cout << endl;
    }

    return 0;
}