#include<cstdio>
#include<list>
#include<vector>
#define MOD 25073
using namespace std;

list <unsigned> H[MOD];
vector <unsigned> v;
int n, l, u, nr;

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

long long Subs(int N){		//nr de subs cu maxim N nr distincte
	int i, j; long long nSub;
	
	for(i = j = nSub = 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
	nr = 0;
	
	return nSub;
}

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