#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(all(w));
vector<pii>W;
for(int i=0;i<sz(w);i++)W.pb({w[i],i});
sort(all(W));
int sum =0;
vector<int>ans;
for(int x:w)sum+=x;
if(sum>=l && w[0] <= u){
int r=0;
int cur = w[0];
for(int L=0;L<sz(w);L++){
while(r+1<sz(w) && cur+w[r+1] <= u){
r++;
cur+=w[r];
}
if(cur>=l && cur <= u){
for(int j=L;j<=r;j++)ans.pb(W[j].se);
break;
}
cur-=w[L];
}
}
return ans;
}
/*
int main()
{
int n,l,u;
cin>>n>>l>>u;
vector<int>w(n);
for(int i=0;i<n;i++)cin>>w[i];
find_subset(l,u,w);
}*/
