#include <cstdio>
#include <map>
using namespace std;
const int nmax=(1<<20)+23;
map<unsigned int,int>ap;
unsigned int v[nmax];
int n,l,u;
int ans(int X)
{
    int dif=0,j=1,st=0;
    for(int i=1;i<=n;i++)
    {
         while(j<=n)
        {
            if(ap[v[j]]==0&&dif==X) break;
            if(ap[v[j]]==0) ++dif;
            ++ap[v[j]];
            ++j;
        }
        st+=j-i;
        --ap[v[i]];
        if(ap[v[i]]==0) --dif;
        if(j<i) j=i;
    }
    return st;
}
inline void citire()
{
    scanf("%d%d%d",&n,&l,&u);
    for(int i=1;i<=n;i++)
    {
        scanf("%ud",&v[i]);
    }
    printf("%d\n",ans(u)-ans(l-1));
}
int main()
{
    freopen ("secv5.in","r",stdin);
    freopen ("secv5.out","w",stdout);
    citire();
}