#include <fstream>
#include <unordered_map>

#define nmax (1<<20)+1
using namespace std;

ifstream fin("secv5.in");
ofstream fout("secv5.out");

unsigned int x[nmax];
int n, l, u;
unordered_map<unsigned int, int>ap;

long long int solve(int l)
{
    ap.clear();
    int j=1; long long int sol=0;
    for(int i=1; i<=n; ++i)
    {
        ++ap[x[i]];
        while(ap.size()>l)
        {
            --ap[x[j]];
            if(ap[x[j]]==0) ap.erase(x[j]);
            ++j;
        }
        sol=sol+i-j+1;
    }
    return sol;
}

int main()
{
    fin>>n>>l>>u;
    for(int i=1; i<=n; ++i) fin>>x[i];
    fout<<solve(u)-solve(l-1)<<"\n";
    return 0;
}