#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "molecules.h"
const int MAXN = 1e2;
const int MAXSUM = 1e5;
bool dp[MAXN+1][MAXSUM+1];
VI find_subset(int L, int R, VI w) {
dp[0][0] = true;
int n = w.size();
rep(i, n) replr(s, 0, MAXSUM) {
dp[i+1][s] |= dp[i][s];
if (s - w[i] >= 0) dp[i+1][s] |= dp[i][s - w[i]];
}
replr(s, L, R) if (dp[n][s]) {
VI ret;
reprl(i, n-1, 0) {
if (dp[i][s]);
else {
s -= w[i];
ret.pb(i);
}
}
return ret;
}
return VI{};
}
