#include <iostream>
#include <fstream>
using namespace std;

#define nmax 1100000

long long n , l , u , x[nmax] , sol = 0 , cont , sir[nmax] , dim;
bool ok;

int gasit (long long nr , long long dim)
{
	for (int i = 1 ; i <= dim ; ++i)
		if (sir[i] == nr)
			return 1;
	return 0;
}
int main ()
{
	ifstream f ("secv5.in");
	ofstream g ("secv5.out");
	
	f >> n >> l >> u;
	
	for (int i = 1 ; i <= n ; ++i)
		f >> x[i];
	
	for (int i = 1 ; i <= n ; ++i)
		for (int j = 1 ; j <= i ; ++j)
		{
			dim = 1;
			sir[dim] = x[j];
			
			for (int p = j ; p <= i ; ++p)
				if (!gasit (x[p] , dim))
					sir[++dim] = x[p];
				
			if (dim >= l && dim <= u)
				sol++;
	}
	
	g << sol;	
		
	return 0;
}