#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#ifdef dremix
#define p(x) cerr<<#x<<" = "<<x<<endl;
#define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
#define pp(x) cerr<<#x<<" = ("<<x.F<<" - "<<x.S<<")"<<endl;
#define pv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u<<", ";cerr<<"}"<<endl;
#define ppv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u.F<<"-"<<u.S<<", ";cerr<<"}"<<endl;
#else
#define p(x) {}
#define p2(x,y) {}
#define pp(x) {}
#define pv(x) {}
#define ppv(x) {}
#endif
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const int N = 5e5+5;
const int MOD = 1e9+7;
const ll INF = 1e18+5;
bool cmp(pi a, pi b){
return a.F > b.F;
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n = w.size();
vector<pi> arr(n);
int i;
for(i=0;i<n;i++){
arr[i] = {w[i],i};
}
sort(all(arr),cmp);
vector<int> s;
s.push_back(0);
int v[N];
memset(v,-1,sizeof(v));
int found = 0, m, c;
ppv(arr)
for(auto &x : arr){
m = s.size();
for(i=0;i<m;i++){
c = x.F + s[i];
if(c > u)break;
if(v[c] == -1){
s.push_back(c);
v[c] = x.S;
if(l<=c){
found = c;
break;
}
}
}
if(found)break;
}
vector<int> ans;
while(found){
ans.push_back(v[found]);
found -= w[v[found]];
}
pv(ans)
return ans;
}
