#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv5.in");
ofstream g("secv5.out");
long long n,l,u;
int a[100000];
int fr1[100000],fr2[100000];
long long c1,c2,st,dr1,dr2,sol,p;

void Citire()
{   int i;
    f>>n>>l>>u;
    for(i=1;i<=n;i++)
    f>>a[i];
}

int Problema()
{
    fr1[a[1]]=fr2[a[1]]=1;
    c1=c2=1;
    dr1=1;
    dr2=1;
    st=1;

    while(dr1<=n)
    {
        if(c1<l)
        {
            ++dr1;
            if(++fr1[a[dr1]]==1)
            ++c1;
        }

        if(c2<=u && dr2<n)
        {
            ++dr2;
            if(++fr2[a[dr2]]==1)
            ++c2;
        }

        else
        if (c1>=l && c2<=u+1)
        {
            sol+=dr2-dr1;
            if(c2<=u) sol++;

            if(--fr1[a[st]]==0)
            --c1;
            if(--fr2[a[st]]==0)
            --c2;
            ++st;
        }
    }
    if(c1==l && c2==l+1)
sol+=dr2-dr1;
   return sol;
}

int main()
{
    Citire();
    g<<Problema()<<"\n";

    f.close();
    g.close();
    return 0;
}