#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int,int>> v(n);
vector<int> out;
int sum = 0;
for(int i = 0; i < n; ++i){
sum+=w[i];
if(sum > u)break;
}
if(sum <= u && sum >= l){
out.resize(n);
iota(out.begin(),out.end(),0);
return out;
}
for(int i = 0; i < n; ++i){
v[i].first = w[i];
v[i].second = i;
}
sort(v.begin(), v.end());
int le = 0, ri = n-1;
sum = v[n-1].first;
while(sum < l && le < ri){
sum+=v[--ri].first;
}
while(sum > u && le < ri && le < n-ri){
sum+=v[le].first;
le++;
sum-=v[n-le].first;
}
if(sum <= u && sum >= l){
for(int i = 0; i < le; ++i){
out.push_back(v[i].second);
}
for(int i = n-1-le; i>= ri; --i){
out.push_back(v[i].second);
}
return out;
}
return vector<int>(0);
}
