#include<cstdio>
#include<list>
#include<vector>
#define MOD 30773
#define U unsigned
using namespace std;

list <U> H[MOD];
vector <U> v;
char buff[50000];
U n, l, u, nr, poz;

void Check(){
	if (++poz == 50000) poz = 0, fread(buff, 1, 50000, stdin);
}

void Read(U &nr){
	nr = 0;
	while(buff[poz] < '0' || buff[poz] > '9') Check();
	while(buff[poz] >= '0' && buff[poz] <= '9'){
		nr = nr * 10 + buff[poz] - '0';
		Check();
	}
}

bool inHash(U x){
	list <U> :: iterator it;
	for (it = H[x % MOD].begin(); it != H[x % MOD].end(); it++)
		if (*it == x) return true;
	return false;
}

long long Subs(U N){		//nr de subs cu maxim N nr distincte
	U i, j; long long nSub;
	
	for(i = j = nSub = nr = 0; i < n; i++){
		if(!inHash(v[i])) nr++;
		H[v[i] % MOD].push_back(v[i]);
		
		while(nr > N){
			H[v[j] % MOD].pop_front();
			if (!inHash(v[j++])) nr--;
		}
		nSub += i - j + 1;
	}
	
	while(j < n) H[v[j++] % MOD].pop_front();			//curat hashul
	return nSub;
}

int main(){
	freopen("secv5.in", "r", stdin), freopen("secv5.out", "w", stdout);
	fread(buff, 1, 50000, stdin);
	Read(n), Read(l), Read(u);
	U i, x;
	
	for(i = 0; i < n; i++)
		Read(x), v.push_back(x);
	
	printf("%lld\n", Subs(u) - Subs(l-1));
	return 0;
}