#include <deque>
#include <fstream>
#include <iostream>
#include <map>
using namespace std;
#define FORIT(it, v)for(typeof((v).begin()) it=(v).begin();it!=(v).end();++it)
const int MAX_N = (1 << 21) + 10;
typedef map<int, int>::iterator mit;
typedef unsigned long long uint64;

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

int N, L, U;
int sir[MAX_N];

uint64 compute_subsets(int*, int, int);
void debug(map<int, int>&, deque<int>&);
int main() {
    fin >> N >> L >> U;
    for (int i = 1; i <= N; ++i) {
        fin >> sir[i];
    }
    fout << compute_subsets(sir, N, U) - compute_subsets(sir, N, L - 1);
}

uint64 compute_subsets(int* v, int n, int limit) {
    if (limit == 0) return 0;
    uint64 result = 0;
    deque<int> dq;
    map<int, int> hash;
    int numValues = 0;
    for (int i = 1; i <= n; ++i) {
        dq.push_back(v[i]);
        int valBack = dq.back();
        mit itBack = hash.find(valBack);
        if (itBack == hash.end()) {
            ++numValues;
            if (numValues > limit) {
                int valFront = dq.front();
                mit itFront = hash.find(valFront);
                while (itFront->second > 1 && !dq.empty()) {
                    --itFront->second;
                    dq.pop_front();
                    if (dq.front() != valFront) {
                        valFront = dq.front();
                        itFront = hash.find(valFront);
                    }
                }
                hash.erase(itFront);
                dq.pop_front();
                --numValues;
            }
            hash.insert(make_pair(valBack, 1));
        } else {
            ++itBack->second;
        }
        result += dq.size();
        debug(hash, dq);
    }
    return result;
}

void debug(map<int, int>& h, deque<int>& d) {
    cerr << "ZE map: \n";
    FORIT (it, h) {
        cerr << it->first << ' ' << it->second << endl;
    }
    cerr << "ZE deq: \n";
    FORIT (it, d) {
        cerr << *it << endl;
    }
    cerr << endl;
}