#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>
veci find_subset(int asd, int asdas, veci w) {
ll l = asd, r = asdas;
int n = sz(w);
vector <pair <ll, int> > a;
for(int i = 0; i < n; ++i)
a.pb(mp(w[i], i));
sort(all(a));
ll sum = 0;
for(int i = n - 1; i >= 0; --i) {
sum += a[i].f;
if(a[n - 1].f - a[i].f <= r - l && l <= sum && sum <= r) {
veci res;
for(int j = i; j < n; ++j) res.pb(a[j].s);
return res;
}
}
multiset <pair <ll, int> > st;
sum = 0;
for(int i = 0; i < n; ++i) {
if(sum >= l) break;
if(sum + a[i].f <= r) {
sum += a[i].f;
st.insert(a[i]);
} else {
if(!st.empty()) {
auto it = *st.rbegin();
st.erase(--st.end());
sum -= it.f;
sum += a[i].f;
st.insert(a[i]);
}
}
}
if(l <= sum && sum <= r) {
veci res;
for(auto it : st) res.pb(it.s);
return res;
}
return {};
}
