#include "molecules.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
using namespace std;
vector<int32_t> find_subset(int32_t l, int32_t r, vector<int32_t> w) {
int n = w.size();
vector <pii> a;
for (int i = 0; i < n; i++) a.emb(w[i], i);
sort(all(a));
int sum = 0;
vector <int32_t> ans;
queue <int> q;
for (int i = 0; i < n; i++) {
sum += a[i].first;
q.emplace(a[i].second);
while (sum > r) {
int idx = q.front();
sum -= w[idx];
q.pop();
}
if (sum >= l && sum <= r) {
while (!q.empty()) ans.emb(q.front()), q.pop();
return ans;
}
}
return ans;
}
