#include <bits/stdc++.h>

using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

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

const int MAX_N = 1050000;
int v[MAX_N];

int n, lower, upper;

unordered_map <int, int> freq;
long long solve(int limit){
    freq.clear();

    long long answer = 0;
    int st = 1, dif = 0;
    for(int i=1; i<=n; i++){
        if(++freq[v[i]] == 1) dif++;

        while(st <= i && dif > limit)
            if(--freq[v[st++]] == 0)
                dif--;

        answer += i-st+1;
    }
    return answer;
}

signed main (){
    fin>>n>>lower>>upper;
    for(int i=1; i<=n; i++)
        fin>>v[i];

    fout<<solve(upper) - solve(lower-1);
    return 0;
}