#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define pll pair<ll,ll>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 2e9+5
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9;
const int nax = 1e5+5;
int st[nax*4];
void update(int v, int l, int r, int pos, int val){
if(r < pos || l > pos) return;
if(l == r){
st[v] += val;
return;
}
int md = (l+r)/2;
update(v*2,l,md,pos,val);
update(v*2+1,md+1,r,pos,val);
st[v] = st[v*2] +st[v*2+1];
}
int query(int v, int l, int r, int i, int j){
if(r < i || l > j) return 0;
if(i <= l && r <= j) return st[v];
int md = (l+r)/2;
return query(v*2,l,md,i,j) + query(v*2+1,md+1,r,i,j);
}
int GetBestPosition(int n, int c, int r, int *k, int *s, int *e) {
vi rngs(n);
for (int i = 0; i < n; ++i)
rngs[i] = i;
for (int i = 0; i < c; ++i)
{
int lb = lower_bound(rngs.begin(), rngs.end(), s[i])-rngs.begin();
int ub = upper_bound(rngs.begin(), rngs.end(), e[i])-rngs.begin()-1;
for (int j = lb; j <= ub; ++j)
rngs[j] = rngs[lb];
for (int j = ub+1; j < n; ++j)
rngs[j] -= (e[i]-s[i]);
s[i] = lb,e[i] = ub;
}
int mx = 0, ps = 0;
int st[n][30];
int log[n+1];
log[1] = 0;
for (int i = 2; i <= n; i++)
log[i] = log[i/2] + 1;
for (int i = 0; i < n-1; i++)
st[i][0] = k[i];
for (int j = 1; j < 30; j++)
for (int i = 0; i + (1 << j) < n; i++)
st[i][j] = min(st[i][j-1], st[i + (1 << (j - 1))][j - 1]);
for (int i = 0; i < n; ++i)
{
int res = 0, ind = i;
for (int j = 0; j < c; ++j)
{
if(s[j] <= i && i <= e[j]){
int cur = min(st[s[j]][j], st[e[j]-1 - (1 << j) + 1][j]);
if(cur < r)
res++;
else break;
}
}
if(res > mx){
mx = res;
ps = i;
}
}
return ps;
}
