#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

namespace {

typedef long long ll;

const int N = 2e5 + 7;

int n;
ll l, u;
pair<int, int> a[N];

}

vector<int> find_subset(int grdl, int grdu, vector<int> grdw) {
	l = grdl;
	u = grdu;
	n = grdw.size();
	for (int i = 0; i < n; ++i) {
		a[i].first = grdw[i];
		a[i].second = i;
	}
	sort(a, a + n);
	ll mnsum = 0, mxsum = 0;
	for (int k = 1; k <= n; ++k) {
		mnsum += a[k - 1].first;
		mxsum += a[n - k].first;
		if (mnsum >= l && mnsum <= u) {
			vector<int> ret;
			for (int i = 0; i < k; ++i) {
				ret.push_back(a[i].second);
			}
			return ret;
		}
		if (mxsum >= l && mxsum <= u) {
			vector<int> ret;
			for (int i = 0; i < k; ++i) {
				ret.push_back(a[i].second);
			}
			return ret;
		}
		if (mnsum > u || mxsum < l) {
			continue;
		}
		ll sum = 0;
		for (int i = 0; i < k - 1; ++i) {
			sum += a[i].first;
		}
		for (int i = k - 1; i >= 0; --i) {
			int l1 = i - 1, r1 = n - k + i + 1;
			while (r1 - l1 > 1) {
				int m1 = (l1 + r1) / 2;
				if (sum + a[m1].first < l) {
					l1 = m1;
				} else {
					r1 = m1;
				}
			}
			if (r1 != n - k + i + 1 && sum + a[r1].first >= l && sum + a[r1].first <= u) {
				vector<int> ret;
				for (int j = 0; j < i; ++j) {
					ret.push_back(a[j].second);
				}
				for (int j = n - k + i + 1; j < n; ++j) {
					ret.push_back(a[j].second);
				}
				ret.push_back(a[r1].second);
				return ret;
			}
			if (i != 0) {
				sum -= a[i].first;
				sum += a[n - k + i].first;
			}
		}
	}
	return {};
}