using namespace std;

#include <map>
#include <set>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <cstdlib>
#include <utility>
#include <algorithm>
#include <functional>

#define sz size
#define f first
#define s second
#define rz resize
#define db double
#define II inline
#define pb push_back
#define mp make_pair
#define ll long long
#define SCORE 100 :)
#define C(v) C.erase( all(v) )
#define all(v) v.begin() , v.end()
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORit(it,v) for(it = (v).begin();it != (v).end();++it)

#define N_MAX 1<<21
#define L_MAX 1<<24
#define IN  "secv5.in"
#define OUT "secv5.out"
#define MOD 666013

char buffer[L_MAX];
unsigned int V1[N_MAX],V2[N_MAX],P[N_MAX];
unsigned int M[N_MAX];
int K(-1),N,L,U;

II unsigned int read()
{
	unsigned int aux(0);
	for(;buffer[K] > '9' || buffer[K] < '0';++K);
	for(;buffer[K] <= '9' && buffer[K] >= '0';++K)
		aux = aux * 10 + buffer[K] - '0';
	return aux;
}

II void scan()
{
	freopen(IN, "r",stdin);
	freopen(OUT, "w",stdout);
	fread(buffer,1,1<<24,stdin);
	N = read();
	L = read();
	U = read();
	FOR(i,1,N)
		M[i] = read();
}


II void hash()
{
	unsigned j,rest;
	FOR(i,1,N)
	{
		rest = M[i] % MOD;
		for(j=rest;P[j] != M[i] && P[j];++j);
		P[j] = M[i];
		M[i] = j;
	}		
}

II long long solve(int  A)
{
	// X = numarul de elemente distincte (va indodeauna egal cu A cand gasim o secventa)
	// x = pozitia de inceput a secventei curente
	int X(0),x(1);
	
	memset(V1,0,sizeof(V1));
	memset(V2,0,sizeof(V2));
	
	FOR(i,1,N)
	{
		if(! (V2[ M[i] ] - V1[ M[i] ]) )
			++X;
		++V2[ M[i] ];
		
		for(;X <= A && i<=N;)
		{
			if( !(V2[ M[i+1] ] - V1[ M[i+1] ]) && X == A)
				break;
			P[i] = x;
			++i;
			if(! (V2[ M[i] ] - V1[ M[i] ]) )
				++X;
			++V2[ M[i] ];
		}	
		
		if(X > A+1)
			exit(-1);
		for(;X > A && x<=N;)
		{
			if( !(V2[ M[x] ] - V1[ M[x] ] - 1) )
				--X;
			++V1[ M[x] ];
			++x;	
		}
		if(X > A)
			exit(-1);
		P[i] = x;
	}
	
	long long rez(0);
	FOR(i,1,N)
		rez += (long long) (i-P[i]+1);
	if(rez < 0)
		rez = 0;
	return rez;	
}

int main()
{
	scan();
	hash();
	printf("%lld\n", solve(U) - solve(L-1) );
	return 0;
}