#include <iostream>
#include <fstream>
#include <unordered_map>
#include <algorithm>
 
using namespace std;
 
ifstream fin("secv5.in");
ofstream fout("secv5.out");
 
int n,u,l;
int ap[(1<<20)+1],id[(1<<20)+1];
unsigned int v[(1<<20)+1],f[(1<<20)+1];
 
long long secv(int k)
{
    for(int i=1;i<=n;i++)
        ap[i]=0;
    long long st=1,cnt=0,sz=0;
    for(int dr=1;dr<=n;dr++)
    {
        if(!ap[f[dr]])
            sz++;
        ap[f[dr]]++;
        while(sz>k)
        {
            ap[f[st]]--;
            if(ap[f[st]]==0)
                sz--;
            st++;
        }
        cnt+=dr-st+1;
    }
    return cnt;
}
 
bool cmp(int a, int b)
{
    return v[a]<v[b];
}
 
int main()
{
    fin >> n >> l >> u;
    for(int i=1;i<=n;i++)
    {
        fin >> v[i];
        id[i]=i;
    }
    sort(id+1,id+n+1,cmp);
    for(int i=1;i<=n;i++)
        if(i>1 && v[id[i]]==v[id[i-1]])
            f[id[i]]=f[id[i-1]];
        else
            f[id[i]]=i;
    fout << secv(u)-secv(l-1);
	return 0;
}