/*
ID: varunra2
LANG: C++
TASK: molecules
*/
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif
#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second
const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
VII vals;
VI get(deque<int>& dq) {
VI ret;
while (!dq.empty()) {
ret.PB(dq.back());
dq.pop_back();
}
sort(all(ret));
return ret;
}
VI find_subset(int l, int u, VI w) {
int n = sz(w);
vals.resize(n);
for (int i = 0; i < n; i++) {
vals[i] = MP(w[i], i);
}
sort(all(vals));
int p1 = 0, p2 = 0;
ll sum = 0;
deque<int> dq;
while (p1 < n) {
while (p2 < n and sum + vals[p2].x <= u)
sum += vals[p2].x, dq.PB(vals[p2++].y);
// debug(sum);
// debug(p1, p2);
if (sum >= l) {
return get(dq);
}
sum -= vals[p1].x;
dq.pop_front();
p1++;
}
return {};
}
// int main() {
// #ifndef ONLINE_JUDGE
// freopen("molecules.in", "r", stdin);
// freopen("molecules.out", "w", stdout);
// #endif
// cin.sync_with_stdio(0);
// cin.tie(0);
// int n, l, r;
// cin >> n >> l >> r;
// VI vals(n);
// for (int i = 0; i < n; i++) {
// cin >> vals[i];
// }
// auto x = find_subset(l, r, vals);
// int sum = 0;
// trav(xx, x) sum += vals[xx];
// cout << sum << '\n';
// return 0;
// }
