#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
vector<int> find_subset(int l, int u, vector<int> w) {
int n = (int)w.size();
vector<pair<int, int>> v(n);
vector<int> ans;
for (int i = 0; i < n; i++) v[i].fi = w[i], v[i].se = i;
sort(v.begin(), v.end());
ll sum = 0;
for (int i = 0; i < n; i++) {
sum += 1ll * v[i].fi;
if (sum > u) {
sum -= 1ll * v[i].fi;
break;
}
ans.push_back(v[i].se);
if (sum >= l) return ans;
}
if (sum < l and (int)ans.size() == n) return vector<int>(0);
int r = n - 1;
for (int i = 0; i < n and r >= (int)ans.size(); i++) {
sum += 1ll * v[r].fi - w[ans[i]];
ans[i] = v[r].se;
if (sum >= l) {
sort(ans.begin(), ans.end());
return ans;
}
r--;
}
return vector<int>(0);
}
