#include <fstream>
#include <algorithm>
using namespace std;
const int NMAX = (1 << 20) + 1;

struct Element{
    unsigned val;
    int poz;
};

Element v[NMAX];
int n, w[NMAX], fr[NMAX];

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

bool comp(const Element& x, const Element& y){
    return x.val < y.val;
}

void Normalizare(){
    sort(v + 1, v + n + 1, comp);
    int x = 1;
    w[v[1].poz] = 1;
    for(int i = 2; i <= n; i++){
        if(v[i].val != v[i - 1].val)
            x++;
        w[v[i].poz] = x;
    }
}

long long Calcul(int dif){
    long long nrSec = 0;
    int nrDif = 0, p = 1, i;
    for(i = 1; i <= n; i++)
        fr[i] = 0;
    for(i = 1; i <= n; i++){
        if(++fr[w[i]] == 1)
            ++nrDif;
        while(nrDif > dif && p <= i){
            if(--fr[w[p]] == 0)
                --nrDif;
            ++p;
        }
        nrSec += i - p + 1;
    }
    return nrSec;
}

int main()
{
    int l, u;
    f >> n >> l >> u;
    for(int i = 1; i <= n; i++){
        f >> v[i].val;
        v[i].poz = i;
    }
    Normalizare();
    g << Calcul(u) - Calcul(l - 1);
    f.close();
    g.close();
    return 0;
}