#include <cstdio>
#include <cstring>
#include <vector>
#define N 1050000
#define MOD 666013

using namespace std;

struct hash
{
    unsigned int val,count;

    hash()
    {
        val=count=0;
    }
};

unsigned int A[N],V[N],B[N];
vector<hash> L[MOD];

void insert(hash x)
{
    int nr=x.val%MOD;
    L[nr].push_back(x);
}

int exists(unsigned int x)
{
    int nr=x%MOD;
    vector<hash>::iterator it;
    for (it=L[nr].begin(); it!=L[nr].end() && it->val!=x; it++);

    if (it==L[nr].end()) return 0;
    else return it->count;
}

int main()
{
    unsigned int n,l,u,i,x,nr=0,ind,kont=0,s1=0,s2=0;
    hash h;
	freopen("secv5.in","r",stdin);
	freopen("secv5.out","w",stdout);
    scanf("%d%d%d",&n,&l,&u);
    //citire si crearea normalizarii in vectorul A
    for (i=1; i<=n; i++)
    {
        scanf("%d",&x);
        if (!exists(x))
        {
            kont++;
            h.val=x; h.count=kont;
            insert(h);
            A[i]=kont;
        }
        else A[i]=exists(x);
    }
    //parcurgerea si crearea vectorului B in care se va tine rezultatul pentru l-1
    l--;
    B[1]=1;
    V[A[1]]=1;
    nr=1;
    ind=1;
    for (i=2; i<=n; i++)
    {
        if (!V[A[i]]) nr++;
        V[A[i]]++;

        for (; nr>l; ind++)
        {
            V[A[ind]]--;
            if (!V[A[ind]]) nr--;
        }

        B[i]=ind;
    }

    for (i=1; i<=n; i++) s1+=i-B[i]+1;
    //calcularea pentru u
    memset(V,0,sizeof(V));

    V[A[1]]=1;
    nr=1;
    ind=1;
    for (i=2; i<=n; i++)
    {
        if (!V[A[i]]) nr++;
        V[A[i]]++;

        for (; nr>u; ind++)
        {
            V[A[ind]]--;
            if (!V[A[ind]]) nr--;
        }

        B[i]=ind;
    }

    for (i=1; i<=n; i++) s2+=i-B[i]+1;

    printf("%d",s2-s1);

    return 0;
}