#include <bits/stdc++.h>

using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
int a[1100000],n;
long long Solve(int x)
{
    unordered_map <int,int> M;
    int p=1;
    long long sol=0;
    for (int i=1; i<=n; i++)
    {
        M[a[i]]++;
        while (M.size()>x)
        {
            M[a[p]]--;
            if (M[a[p]]==0) M.erase(a[p]);
            p++;
        }
        sol+=(i-p+1);
    }
    return sol;
}
int main()
{
    int l,u,i;
    fin >> n >> l >> u;
    for (i=1; i<=n; i++)
    fin >> a[i];
    fout << (Solve(u)-Solve(l-1)) << "\n";



    return 0;
}