#include "molecules.h"
using namespace std;
#define ll long long
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
ll n = (ll)w.size();
vector<ll> ps(n); ll vals[n];
for (ll i = 0; i < n; ++i) vals[i] = (ll)w[i];
ll L = (ll)l, R = (ll)u;
ps[0] = vals[0];
for (ll i = 1; i < n; ++i) ps[i] = ps[i - 1] + vals[i];
for (ll i = 0; i < n; ++i) {
ll xprev = 0;
if (i) xprev = ps[i - 1];
ll xmin = xprev + L, xmax = xprev + R;
ll lm = n, rm = n;
ll left = i, right = n - 1;
while (left <= right) {
ll mid = (left + right) / 2;
if (ps[mid] >= xmin) {
lm = mid;
right = mid - 1;
} else left = mid + 1;
}
left = i, right = n - 1;
while (left <= right) {
ll mid = (left + right) / 2;
if (ps[mid] >= (xmax + 1)) {
rm = mid;
right = mid - 1;
} else left = mid + 1;
}
if (lm < n && (rm - lm) > 0) {
ll fst = lm, lst = rm - 1;
vector<int> ret;
for (ll i = fst; i <= lst; ++i) ret.push_back((int)i);
return ret;
}
}
return vector<int>(0);
}
