/*
 * Cel putin L - cel putin U + 1 :)
 * this way seems to be a little more simple
 *
 * HASH is BAD, HASH is EVIL
 */

#include <cstdio>
#include <cstring>
#include <ext/hash_map>

using namespace std;
using namespace __gnu_cxx;

const int NMAX = 1 << 20;

int N, L, U, W;
int A[NMAX], V[NMAX + 16];
hash_map <int, int> H;

void read() {
	FILE *fin = fopen("secv5.in", "rt");
	int i, aux, t;

	fscanf(fin, " %d %d %d", &N, &L, &U);

	for (i = 0; i < N; ++i) {
		fscanf(fin, " %d", &aux);

		t = H[aux];
		if (t == 0) {
			++W; t = W;
			H[aux] = W;
		}
		A[i] = t;
	}

	fclose(fin);
}

long long least(int k) {
	int i, Q;
	int nr = 0;
	long long rez = 0;

	Q = 0;

	for (i = 0; i < N; ++i) {
		++V[A[i]];
		if (V[A[i]] == 1) ++nr;

		while (1) {
			if (nr > k || (nr == k && V[A[Q]] > 1)) {
				--V[A[Q]];
				if (V[A[Q]] == 0) --nr;
				++Q;
			} else break;
		}
		
		if (nr == k) rez += Q + 1;
	}

	for (; Q < N; ++Q) V[A[Q]] = 0;

	return rez;
}

void write() {
	FILE *fout = fopen("secv5.out", "wt");

	fprintf(fout, "%lld\n", least(L) - least(U + 1));

	fclose(fout);
}

int main() {
	
	read();

	write();

	return 0;
}