#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 200005;
const int inf = 1e9 + 5;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
int n;
pii niz[maxn];
vector<int> find_subset(int l, int r, vector<int> w){
n = sz(w);
ff(i,1,n)niz[i] = {w[i - 1], i};
sort(niz + 1, niz + n + 1);
vector<int> res;
int j = 0;
int zbir = 0;
ff(i,1,n){
while(j + 1 <= n && zbir < l){
j += 1;
zbir += niz[j].fi;
}
if(zbir >= l && zbir <= r){
ff(o,i,j)res.pb(niz[o].se - 1);
return res;
}
zbir -= niz[i].fi;
}
return res;
}
//int main()
//{
// ios::sync_with_stdio(false);
// cout.tie(nullptr);
// cin.tie(nullptr);
// int l, r, n;
// cin >> l >> r >> n;
// vector<int> a(n);
// ff(i,0,n - 1)cin >> a[i];
//
// auto x = find_subset(l, r, a);
// for(auto c : x)cout << c << " ";
// cout << endl;
//
// return 0;
//}
/**
// probati bojenje sahovski ili slicno
**/
