#include <cstdio>
#include <set>
#define maxn 1<<20

using namespace std;

int dp[maxn], x[maxn];
int n, L, U;
void citire()
{
	freopen("secv5.in", "r", stdin);
	
	scanf("%d %d %d\n", &n, &L, &U);
	for(int i=1;i<=n;i++) scanf("%d\n", x+i);
	
}

void calcul()
{
	int i, j;
	if(L==1)dp[1]=1;
	
	for(i=2;i<=n;i++)
	  if(x[i]==x[i-1]) dp[i]=dp[i-1];
	  else
	  {
		//printf("da\n");
		set<int> Q;
		Q.insert(x[i]);
		if(L==1) dp[i]++;
		for(j=i-1;j>=1 && Q.size()<=U; j--)
		{
			int ok=1;
			//if(Q.find(x[j])!=Q.end()) ok=0;
		//	else
			Q.insert(x[j]);
			if(Q.size()>=L && Q.size()<=U )dp[i]++;
			
			//printf("%d ", x[j]);
			if(Q.size()>U) break;
		
		}
	//printf("\n");
	//printf("%d %d\n", i, dp[i]);
	//for(set<int>::iterator it=Q.begin();it!=Q.end();it++) printf("%d ", *it);
	//printf("\n");
	}
	
	int sum=0;
	for(i=1;i<=n;i++) sum+=dp[i];
	freopen("secv5.out", "w", stdout);
	printf("%d\n", sum);
}

int main()
{
	citire();
	calcul();
	return 0;
}