#include<cstdio>
#include<algorithm>
#include<set>
#include<utility>
#include<vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define itr(it,a) for(auto it=(a).begin();it!=(a).end();++it)

typedef std::pair<int, int> Pr;

const int MAX_N = 31;

int N, S;
int P[MAX_N];
int S1[1<<16];
Pr S2[1<<16];

int main()
{
	scanf( "%d%d", &N, &S );
	rep( i, N )
		scanf( "%d", P+i );

	rep( i, 1<<(N>>1) ) rep( j, N>>1 ) if( i>>j&1 )
		S1[i] += P[j];
	rep( i, 1<<N-(N>>1) )
	{
		rep( j, N-(N>>1) ) if( i>>j&1 )
			S2[i].first += P[j+(N>>1)];
	
		S2[i].second = i;
	}

	std::sort( S2, S2+(1<<N-(N>>1)) );

	std::set<std::vector<int> > s;
	Pr *p;

	rep( i, 1<<(N>>1) ) if( (p = std::lower_bound( S2, S2+(1<<N-(N>>1)), Pr( S-S1[i], 0 ) ))->first == S-S1[i] )
	{
		do
		{
			std::vector<int> v;

			rep( k, N>>1 ) if( i>>k&1 )
				v.push_back( k+1 );
			rep( k, N-(N>>1) ) if( p->second>>k&1 )
				v.push_back( k+1+(N>>1) );
			
			s.insert( v );
		} while( (++p)->first == S-S1[i] );
	}

	itr( it, s ) rep( i, it->size() )
		printf( "%d%c", (*it)[i], i==it->size()-1?'\n':' ' );

	return 0;
}