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

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

using namespace std;
using namespace __gnu_cxx;

const int NMAX = 1 << 20;
const int DMAX = 1 << 17;

#define MP make_pair

int N, L, U;
int A[NMAX];
hash_map <int, int> H;

void read() {
	FILE *fin = fopen("secv5.in", "rt");
	int i, j, aux;
	char buf[16];

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

	for (i = 0; i < N; ++i) {
		fgets(buf, 16, fin);

		for (aux = 0, j = 0; buf[j] && buf[j] != '\n'; ++j)
			aux = (aux * 10) + (buf[j] - '0');
		
		A[i] = aux;
	}

	fclose(fin);
}

long long least(int k) {
	int i, Q;
	hash_map <int, int> :: iterator it;
	int nr = 0;
	long long rez = 0;

	H.clear(); Q = 0;

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

		while (1) {
			it = H.find(A[Q]);
			if (nr > k || (nr == k && (*it).second > 1)) {
				--(*it).second; ++Q;
				if ((*it).second == 0) --nr;
			} else break;
		}
		
		if (nr == k) rez += Q + 1;
	}

	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;
}