#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<vector>
#define M 666013
#define NMax (1<<20)+5
using namespace std;

unsigned v[NMax];
int n;
vector<pair<unsigned,int> > a[M];

vector<pair<unsigned,int> >::iterator find (unsigned x)
{
    vector<pair<unsigned,int> >::iterator it;
    for (it=a[x%M].begin(); it!=a[x%M].end(); ++it)
        if ((it->first)==x)
            return it;
    return a[x%M].end();
}

void hash ()
{
    int i;
    for (i=1; i<=n; i++)
        if (find(v[i])==a[v[i]%M].end())
            a[v[i]%M].push_back(make_pair(v[i],0));
}

void reset (int x)
{
    int i;
    vector<pair<unsigned,int> >::iterator it;
    for (i=x; i<=n; i++)
    {
        it=find(v[i]);
        it->second=0;
    }
}

unsigned sol (int x)
{
    if (!x) return 0;
    unsigned nr=1,st=1,i,sum=1;
    vector<pair<unsigned,int> >::iterator it;
    it=find(v[1]);
    it->second=1;
    for (i=2; i<=n; i++)
    {
        it=find(v[i]);
        if (it->second==0)
            nr++;
        it->second++;
        while (nr>x)
        {
            it=find(v[st]);
            if (it->second==1)
                nr--;
            it->second--;
            st++;
        }
        sum+=i-st+1;
    }
    reset(st);
    return sum;
}

int main ()
{
    char s[10];
    int l,u,i;
    freopen("secv5.in","r",stdin);
    freopen("secv5.out","w",stdout);
    scanf("%d%d%d",&n,&l,&u);
    for (i=1; i<=n; i++)
    {
        scanf("%s",s);
        v[i]=strtoul(s,NULL,10);
    }
    hash();
    printf("%u\n",sol(u)-sol(l-1));
    return 0;
}