#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <map>
using namespace std;

#define nmax 1050000

int l,u,n,i,j;
long long a[nmax],nr;
long long rr;
map<int,int> h;

long long solve(int x)
{
    i=nr=rr=0;
    for (j=0;j<n;++j)
    {
        if (h[a[j]]==0)
            ++nr;
        ++h[a[j]];
        while (nr>x)
        {
            if (h[a[i]]==1)
                --nr;
            --h[a[i]];
            ++i;
        }
        rr+=j-i+1;
    }
    for (;i<n;++i)
        --h[a[i]];
    return rr;
}

int main()
{
    freopen("secv5.in","r",stdin);
    freopen("secv5.out","w",stdout);
    
    scanf("%d%d%d",&n,&l,&u);
    for (i=0;i<n;i++)
        scanf("%lld",a+i);
    printf("%lld\n",solve(u)-solve(l-1));

    return 0;
}