#include <iostream>
#include <fstream>
#include <cstring>
#include <unordered_map>
#define DMAX 2000000

using namespace std;

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

long element[DMAX], n, l ,u ;

void citire(){
    in >> n >> l >> u;
    for(int i = 1; i <= n; i++){
        in >> element[i];
    }
}

long long numarSecvente(int limita){
    unordered_map <long, int>frecv;
    int nrElemDis = 0;
    int index = 1;
    long long calcul = 0;
    for(int i = 1; i <= n; i++){
        if(frecv[element[i]] == 0){
            nrElemDis++;
        }
        frecv[element[i]]++;
        while(nrElemDis > limita){
            frecv[element[index]]--;
            if(frecv[element[index]] == 0){
                frecv.erase(element[index]);
                nrElemDis --;
            }
            index++;
        }
        calcul = 1LL * (calcul + i - index);
    }
    return calcul;
}

void rezolvare(){
    out << numarSecvente(u) - numarSecvente(l - 1);
}

int main() {
    citire();
    rezolvare();
    return 0;
}