#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
int branks[5010];
memset(branks,-1,sizeof branks);
for (int i = 0 ; i < C;i++){
for (int j=S[i]; j <=E[i];++j){
if (K[j]>branks[i])branks[i]=K[j];
}
}
int maxrcrd=0;
int maxwho=0;
for (int i = N-1 ; i >= 0;--i){
int localrcrd=0;
for (int j = 0; j < C; j++){
if ( i >=S[j] && i<=E[j]){
if ( R > branks[j] )++localrcrd;
else break;
}
}
if (localrcrd>=maxrcrd){maxrcrd=localrcrd;maxwho=i;}
}
return maxwho;
}
