#include <iostream>
#include <fstream>
#include <unordered_map>

using namespace std;

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

int n, l, u;
unsigned int a[1050000];

int secvente(int x)
{
    unordered_map<unsigned int, int> f;
    int lo = 0, hi = 0;
    int rez = 0, dist = 0;
   // f[a[lo]]++;
    while(hi < n)
    {
        if(f[a[hi]] == 0) dist++;
        f[a[hi]]++;
        while(dist > x)
        {
            f[a[lo]]--;
            if(f[a[lo]] == 0) dist--;
            lo++;
        }
        if(dist <= x)
            rez += hi-lo+1;
        hi++;
    }
    return rez;
}

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