#include <iostream>

#include <fstream>

#include <map>

#include <algorithm>

#include <vector>

#include <string>

using namespace std;

#define all(x) x.begin(), x.end()

using namespace std;

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


const int nmax = (1 << 20);

int n, l, r;
int v[nmax + 5];

long long secvente(int l, int r) {
	long long secv = 0;
	int d1 = 0;
	int d2 = 0;
	map<int, int> fr1;
	map<int, int> fr2;
	for (int st = 1, dr1 = 0, dr2 = 0; st <= n; ++st) {
		while (dr1 < n and d1 < l) {
			fr1[v[++dr1]]++;
			d1 += (fr1[v[dr1]] == 1);
		}
		while (dr2 < n) {
			int urmatorul = v[dr2 + 1];
			int este_nou = (fr2[urmatorul] == 0);
			if (d2 + este_nou <= r) {
				dr2++;
				fr2[v[dr2]]++;
				d2 += este_nou;
			}
			else {
				break;
			}
		}
		if (d1 == l and d2 <= r) {
			secv += dr2 - dr1 + 1;
		}
		fr1[v[st]]--;
		fr2[v[st]]--;
		d1 -= (fr1[v[st]] == 0); d2 -= (fr2[v[st]] == 0);
		if (dr1 < st) { dr1 = st; d1 = 0; }
		if (dr2 < st) { dr2 = st; d2 = 0; }
	}
	return secv;
}

int main() {

	fin >> n >> l >> r;
	for (int i = 1; i <= n; ++i) {
		fin >> v[i];
	}
	fout << secvente(l, r);


}