#include "molecules.h"
#include <algorithm>
#include <stdio.h>
#include <vector>

namespace
{

typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}

std::vector<uint> solve(uint l,uint r,std::vector<uint>V)
{
    uint n=V.size();std::vector<uint>P(n);for(uint i=0;i<n;i++)P[i]=i;
    std::sort(P.begin(),P.end(),[&](uint a,uint b){return V[a]<V[b];});
    for(uint i=0,j=0,s=0;i<n;s-=V[P[i++]])
    {
        while(j<n&&s<l)s+=V[P[j++]];
        if(s<l)return{};
        if(s<=r)return std::vector<uint>(P.begin()+i,P.begin()+j);
    }
    return{};
}

}

std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
    std::vector<uint>V;
    for(auto s:w)V.push_back(s);
    V=solve(l,u,V);
    w.clear();
    for(auto s:V)w.push_back(s);
    return w;
}


/*

g++ 235.cpp grader.cpp -o code -std=c++11

*/