#include #include using namespace std; #define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++) #define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define el '\n' #define spa " " #define Yes cout << "Yes" << el #define No cout << "No" << el #define YES cout << "YES" << el #define NO cout << "NO" << el #define inp(x) for(auto &i:x)cin>>i #define eps (1e-10) #define Equals(a,b) (fabs((a) - (b)) < eps ) #define debug(x) cerr << #x << " = " << x << el using ll = long long; using ull = unsigned long long; using i128 = __int128_t; using boost::multiprecision::cpp_int; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvl = vector>; using vs = vector; using vb = vector; const double pi = 3.141592653589793238; const int inf = 1073741823; const ll infl = 1LL << 60; const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string abc = "abcdefghijklmnopqrstuvwxyz"; const ll MOD = 998244353; #include using namespace atcoder; using mint = modint998244353; using vm = vector; vl CC(vl &A,ll x){ ll n=A.size(); vl C(n,-1); ll l=-1; ll now=0; rep(i,0,n){ now=A[i]; if(now=x){ l++; } C[i]=l+1; } rep(i,1,n){ if(C[i-1]==-1)continue; C[i]=max(C[i],C[i-1]+1); } return C; } vl RCC(vl &A,ll x,ll l){ vl B=A; reverse(all(B)); for(auto &b:B)b=l-b; auto C=CC(B,x); reverse(all(C)); return C; } bool Check(vl A,ll x,ll l,ll k){ auto B=CC(A,x); auto C=RCC(A,x,l); rep(i,0,A.size()){ if(B[i]>=0&&C[i]>=0&&B[i]+C[i]+1>=k)return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll n,l,k;cin>>n>>l>>k; vl A(n);inp(A); debug(Check(A,4,l,k)); ll y=1,z=l+1; while(z-y>1){ ll m=(y+z)/2; if(Check(A,m,l,k))y=m; else z=m; } cout<