#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#include<unordered_map>
#include<sstream>
using namespace std;
 
ofstream out("secv5.out");
 
const int mx=(1<<20)+100;
int n,l,u;
vector<long long> v;
 
class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;
 
	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}
 
public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}
 
	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
 
	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
 
 
 
void read(){
	InParser in("secv5.in");
	in>>n>>l>>u;
	v.resize(n);
	for(int i=0;i<n;i++){
		in>>v[i];
	}
}
 
unsigned long long solve(unsigned k){
	unordered_map<unsigned,int> values(mx);
	unsigned l=0;
	unsigned long long sum=0;
 
	for(int i=0;i<n;i++){
		values[v[i]]++;
 
		while(values.size()>k){
			values[v[l]]--;
			if(values[v[l]]==0){
				values.erase(values.find(v[l]));
			}
			l++;
		}
		sum+=(i-l+1);
	}
	return sum;
}
 
void solve(){
	out<<solve(u)-solve(l-1);
}
 
int main(){
	read();
	solve();
	return 0;
}