/*
by vlad D.
   :)
*/
#include <cstdio>
#include <ext/hash_map>
#include <map>
using namespace std;
unsigned int ret;
unsigned int N, A, B;
unsigned int sol[1048588], unde[1048590];
unsigned int i, j;

//hash_map<unsigned int, int, hash<const int> > Q;
//int Q[10];
int main() {
	freopen("secv5.in", "r", stdin);
	freopen("secv5.out", "w", stdout);
	hash_map< unsigned int, int> Q;
	scanf("%u %u %u", &N, &B, &A);
	int pas = 0;
	for (i=1; i<=N; i++) {
		int X;
		scanf("%u", &X);
		int c = Q[X];
		if (c == 0) {Q[X]=++pas; c = pas;}
		sol[i] = c;
		}
	//Q.clear();
	int cate = 0;
	int last = 1;
	for (i=1; i<=N; i++) {
		unde[sol[i]]++; if (unde[sol[i]] == 1) cate++;
		while (cate > A) {unde[sol[last]]--; if (unde[sol[last]] == 0) cate--; last++;}
		ret+= 1+ i - last ;
		}
	B--;
	last = 1, cate = 0;
	for (i=1; i<=pas; i++) unde[i] = 0;
	if (B>0)
		for (i=1; i <=N; i++) {
		unde[sol[i]]++; if (unde[sol[i]] == 1) cate++;
		while (cate > B) {unde[sol[last]]--; if (unde[sol[last]] == 0) cate--; last++;}
		ret-= i+1 - last;
		}
	printf("%u\n", ret);
	return 0;
}