#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
ll ps[32], rem[32];
bool used[32];
int n;
ll s;
void dfs(int k, ll sum) {
    if (k == n) {
	if (sum == s) {
	    vector<int> res;
	    for (int i = 0; i < n; i++)
		if (used[i])
		    res.push_back(i+1);
	    int len = res.size();
	    for (int i = 0; i < len-1; i++)
		printf("%d ", res[i]);
	    printf("%d\n", res[len-1]);
	}
    } else {
	if (sum + ps[k] + rem[k] >= s) {
	    used[k] = true;
	    dfs(k+1, sum+ps[k]);
	    used[k] = false;
	}
	if (sum + rem[k] >= s) dfs(k+1, sum);
    }
}

int main() {
    scanf("%d%lld", &n, &s);

    for (int i = 0; i < n; i++) {
	scanf("%lld", &ps[i]);
    }
    ll sum = 0;
    for (int i = n-1; i >= 0; i--) {
	rem[i] = sum;
	sum += ps[i];
    }

    dfs(0, 0);
}