#include <fstream>
#include <algorithm>

#define MAX 1000005

using namespace std;

int N, L, U, lCnt, rCnt, sol;
unsigned int aux[MAX], V[MAX];
int leftAp[MAX], rightAp[MAX];

inline void add(int val, int V[], int &cnt)
{
    if(V[val]++ == 0) cnt++;
}

inline void rmv(int val, int V[], int &cnt)
{
    if(--V[val] == 0) cnt--;
}

int main()
{
    ifstream in("secv5.in"); in>>N>>L>>U;
    for(int i = 1; i <= N; i++) in>>V[i], aux[i] = V[i];
    in.close();
    sort(aux + 1, aux + N + 1); aux[0] = 1;
    for(int i = 2; i <= N; i++) if(aux[aux[0]] != aux[i]) aux[++aux[0]] = aux[i];
    for(int i = 1; i <= N; i++) V[i] = lower_bound(aux + 1, aux + aux[0] + 1, V[i]) - aux;
    for(int i = 1, left = 1, right = 1; i <= N && (right <= N || rCnt >= L); i++)
    {
        for(; left <= N; left++)
        {
            add(V[left], leftAp, lCnt);
            if(lCnt == L)
            {
                rmv(V[left], leftAp, lCnt);
                break;
            }
        }
        for(; right <= N && rCnt <= U; right++)
        {
            add(V[right], rightAp, rCnt);
            if(rCnt > U)
            {
                rmv(V[right], rightAp, rCnt);
                break;
            }
        }
        sol += (right - left);
        rmv(V[i], leftAp, lCnt); rmv(V[i], rightAp, rCnt);
    }
    ofstream out("secv5.out"); out<<sol<<"\n"; out.close();
    return 0;
}