#include <stdio.h>
#include <algorithm>
#define MaxN 1100000

using namespace std;

int n, p, u, nr, poz=0;
unsigned a[MaxN], nou[MaxN], nr1[MaxN], nr2[MaxN];
long long big, val[MaxN];
char buf[15<<20];

void smart()
{
     int i, j, k;
     long long sol=0;
     int l1=0, l2=0, dif1=1, dif2=1;
     nr1[a[0]]++; nr2[a[0]]++;
     for (i=0; i<n; i++){
         if (i){
            nr1[a[i-1]]--;
            if (nr1[a[i-1]]==0) dif1--;
         }
         while (dif1<p && l1<n-1){
               l1++;
               if (nr1[a[l1]]==0) dif1++;
               nr1[a[l1]]++;
         }

         if (i){
            nr2[a[i-1]]--;
            if (nr2[a[i-1]]==0) dif2--;
         }
         while (dif2<u && l2<n-1){
               l2++;
               if (nr2[a[l2]]==0) dif2++;
               nr2[a[l2]]++;
         }
         while (l2<n-1 && nr2[a[l2+1]]>0){
               l2++;
               nr2[a[l2]]++;
         }
         if (dif1>=p) sol+=l2-l1+1;
     }
     printf("%lld\n", sol);
}

void cit(unsigned &x)
{
     x=0;
     while (buf[poz]<'0') poz++;
     while (buf[poz]>='0') x=x*10+buf[poz++]-'0';
}

int main()
{
    freopen("secv5.in", "r", stdin);
    freopen("secv5.out", "w", stdout);
    scanf("%d %d %d\n", &n, &p, &u);
    fread(buf, 1, sizeof(buf), stdin);
    int i,j,k;
    for (i=0; i<n; i++){
        unsigned x;
        cit(x);
        val[i]=((long long) x << 22) + i;
    }
    big=(1<<22)-1;
    sort(val, val+n); 
    nr=0;
    nou[val[0] & big]=nr;
    for (i=1; i<n; a[val[i] & big]=nr, i++)
        if (val[i-1]>>22 != val[i]>>22) nr++;
    nr++;
    smart();
    return 0;
}