#include <stdio.h>
#include <math.h>
#include <string.h>
#define dim_hash 200000
#define nmax 1048577
#define golden (sqrt(5)-1)/2

long n,l,u,aparitii[nmax],i,j,ind[nmax],key,distincte,hash[dim_hash][24],nou;
unsigned long x[nmax];
long long total1,total2;
double frac;
char c[10];

void secvente1()
{
long j=1;
long nr=0;
for (i=1;i<=n;++i)
    {
	      if (aparitii[ind[i]]==0) ++nr;
	      ++aparitii[ind[i]];
      while (nr>l-1)
	    {
	     if (aparitii[ind[j]]==1) --nr;
	     --aparitii[ind[j++]];
            }
      total1 += i-j+1;
    }
}
void secvente2()
{
long j=1;
long nr=0;
for (i=1;i<=n;++i)
    {
	      if (aparitii[ind[i]]==0) ++nr;
	      ++aparitii[ind[i]];
      while (nr>u)
	    {
	     if (aparitii[ind[j]]==1) --nr;
	     --aparitii[ind[j]];
	     ++j;
            }
      total2 += i-j+1;
    }
}

int main()
{
freopen("secv5.in","r",stdin);
scanf("%ld %ld %ld\n",&n,&l,&u);
for (i=1;i<=n;++i)
    {
    scanf("%s\n",c);
    nou=strlen(c);
    j=0;
    while (j<nou)
          {
          x[i]=x[i]*10+(c[j]-'0');
          ++j;
          }
    //scanf("%lu\n",&x[i]);
    //frac=(x[i]*golden)-floor(x[i]*golden);
    //key = floor( frac * dim_hash );
    key=x[i] - (x[i]/dim_hash)*dim_hash;
    nou=0;
    for (j=1;j<=hash[key][0];++j)
	if (x[i]==x[hash[key][j]]) {
				 nou=hash[key][j];
                                 break;
                                 }
    if (nou==0)
       {
       hash[key][++hash[key][0]] = i;
       ++distincte;
       ind[i] = distincte;
       }
       else ind[i]=ind[nou];
    }
fclose(stdin);
secvente1();
memset(aparitii,0,sizeof(aparitii));
secvente2();
freopen("secv5.out","w",stdout);
printf("%lld",total2-total1);
fclose(stdout);
return 0;
}