#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
using ll = long long;
const int N = 5e5 + 5;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
pair<int, int> v[N];
namespace sub5 {
bool check(int n, int l, int u) {
return (n <= 10000 && u <= 500000);
}
bitset<N> dp;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
dp[0] = 1;
for (int &x: w) {
dp |= (dp << x);
}
int cand_weight = -1;
for (int x = l; x <= u; x++) {
if (dp[x] == 1) {
cand_weight = x;
break;
}
}
if (cand_weight == -1) {
return vector<int> {};
}
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
v.push_back({w[i], i});
}
for (int _ = 0; _ <= 100; _++) {
shuffle(all(v), rng);
vector<int> ans;
int cur = cand_weight;
for (int i = 0; i < n; i++) {
if (cur - v[i].first >= 0 && dp[cur - v[i].first]) {
ans.push_back(v[i].second);
cur -= v[i].first;
}
}
if (cur == 0) return ans;
}
return vector<int> {};
}
}
namespace sub6 {
pair<int, int> v[N];
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
for (int i = 0; i < n; i++) {
v[i] = {w[i], i};
}
sort(v, v + n);
if (v[0].first >= l && v[0].first <= u) {
return vector<int> {0};
}
if (v[n - 1].first >= l && v[n - 1].first <= u) {
return vector<int> {n - 1};
}
if (v[0].first > u) {
return vector<int> {};
}
for (int _ = 0; _ <= 500; _++) {
vector<int> ans;
ll cur = 0;
for (int i = 0; i < n; i++) {
cur += v[i].first;
ans.push_back(v[i].second);
if (cur >= l && cur <= u) {
return ans;
}
}
int B = rng() % 100 + 1;
for (int L = 0; L < n; L += B) {
int R = min(n - 1, L + B - 1);
shuffle(v + L, v + R + 1, rng);
}
}
return vector<int> {};
}
};
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
if (sub5::check(n, l, u)) return sub5::find_subset(l, u, w);
return sub6::find_subset(l, u, w);
}
#ifdef LOCAL
void solve() {
int n, l, u; cin >> n >> l >> u;
vector<int> w(n); for (int &x: w) cin >> x;
auto ans = find_subset(l, u, w);
for (int x: ans) cout << x << ' ';
cout << '\n';
}
signed main() {
cin.tie(0) -> sync_with_stdio(0);
int T = 1; // cin >> T;
while (T--) {
solve();
}
}
#endif
