/*
* File created on 04/07/2022 at 22:12:14.
* Link to problem:
* Description:
* Time complexity: O()
* Space complexity: O()
* Status: ---
* Copyright: Ⓒ 2022 Francois Vogel
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
#define pii pair<int, int>
#define f first
#define s second
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define size(x) (int)((x).size())
#define pb push_back
#define ins insert
#define cls clear
#define int ll
#define ll long long
#define ld long double
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int siz = 1e4+40;
vector<signed> find_subset(signed start, signed end, vector<signed> b) {
vector<pii> sorted;
for (int i = 0; i < size(b); i++) sorted.pb(pii(b[i], i));
sort(all(sorted));
int till = 0;
int sum = 0;
for (int i = 0; i < size(b); i++) {
if (i) sum -= sorted[i-1].f;
while (sum < start && till < size(b)) {
sum += sorted[till].f;
till++;
}
if (start <= sum && sum <= end) {
vector<signed> res;
for (int j = i; j < till; j++) res.pb(sorted[j].s);
return res;
}
}
return {};
}
// signed main() {
// cin.tie(0);
// ios_base::sync_with_stdio(0);
// int n, l, u;
// cin >> n >> l >> u;
// vi b(n);
// for (int i = 0; i < n; i++) cin >> b[i];
// vi res = find_subset(l, u, b);
// for (int i : res) cout << i << ' ';
// cout.flush();
// int d = 0;
// d++;
// }
