#include <bits/stdc++.h>

using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
int n,l,u;
const int Nmax=(1<<20)+3;
unsigned int a[Nmax],b[Nmax];
int v[Nmax];
long long nr_secv(int k)
{
    unordered_map<unsigned int,int> mapa;
    int st=1;
    long long cnt=0;
    for (int i=1;i<=n;i++)
    {
        mapa[v[i]]++;
        while (mapa.size()>k)
        {
            mapa[v[st]]--;
            if (mapa[v[st]]==0) mapa.erase(v[st]);
            st++;
        }
        cnt=cnt+(i-st+1);
    }
    return cnt;
}
int main()
{
    fin>>n>>l>>u;
    for (int i=1;i<=n;i++)
        fin>>a[i],b[i]=a[i];
    sort(b+1,b+n+1);
    for (int i=1;i<=n;i++)
        v[i]=lower_bound(b+1,b+n+1,a[i])-b;
    long long nr1=nr_secv(l-1);
    long long nr2=nr_secv(u);
    fout<<nr2-nr1;
    return 0;
}