#include "molecules.h"
// author : sentheta aka vanwij
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<random>
#include<chrono>
#include<cmath>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second
#define rand() (uniform_int_distribution<int>(0,1<<30)(rng))
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))
#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define dbg(x) if(1) cout << "?" << #x << " : " << (x) << endl << flush;
int n;
V<int> ans;
V<int> find_subset(int l,int r,V<int> a){
n = a.size();
V<int> ord;
rep(i,0,n) ord.push_back(i);
sort(all(ord),[&](int i,int j){
return a[i]<a[j];
});
int sum = 0;
int i=0, j=n-1;
rep(i,0,n){
if(sum+a[ord[i]]<=r){
sum += a[ord[i]];
ans.push_back(ord[i]);
}
}
while(sum<l && i<j){
sum += a[ord[j]]-a[ord[i]];
ans[i] = ord[j];
j--; i++;
}
if(l<=sum && sum<=r){
sort(all(ans));
for(int& i : ans) i++;
return ans;
}
return {};
}
