#include <bits/stdc++.h>   using namespace std;   int C[200005], A[200005], n, k, i, j, mx;   int main() {     scanf( %d%d%d , &n, &i, &k);     for (i = 1; i <= n; i++) scanf( %d , &A[i]);     for (i = j = 1; i <= n; i++) {       while (j - i + 1 - C[A[i]] - (A[j] == A[i]) <= k && j <= n) {         C[A[j]]++;         j++;       }       if (j - i - C[A[i]]-- <= n) mx = max(mx, C[A[i]] + 1);     }     printf( %d , mx);     return 0;   }   