#include "molecules.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
ll pref[200001];
vi find_subset(int L, int U, vi w)
{
vector<pll> w2;
rep(i,siz(w))
{
w2.pb({w[i],i});
}
sort(all(w2));
rep(i,siz(w2))
{
pref[i+1] = pref[i] + w2[i].ff;
}
ll min_ = w2[0].ff;
rep2(cnt,1,siz(w))
{
if(pref[cnt] <= U && pref[siz(w)] - pref[siz(w)-cnt] >= L)
{
ll cur_ans = 0;
int l = 0;
int r = cnt-1;
rep2(k,l,r) cur_ans += w2[k].ff;
while(cur_ans < L)
{
cur_ans -= w2[l].ff;
l++;
r++;
cur_ans += w2[r].ff;
}
vi ans;
rep2(k,l,r) ans.pb(w2[k].ss);
return ans;
}
}
return {};
}
