#include <cstdio>
#include <queue>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cassert>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <list>
#include <functional>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef long long LL;
typedef unsigned int uint;

#ifdef INFOARENA
#define ProblemName "secv5"
#endif

#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "fis.in"
#define OuFile "fis.out"
#endif

#define MAXN 1058576
uint v[MAXN];
int N, L, U;

LL ans(int k) {
	unordered_multiset<uint> S;
	int diff = 0;
	int l = 0;
	LL rez = 0;
	for (int r = 0; r < N; ++r) {
		if (!S.count(v[r]))
			++diff;
		S.insert(v[r]);
		while (diff > k) {
			if (S.count(v[l]) == 1)
				--diff;
			S.erase(S.find(v[l++]));
		}
		rez += r - l + 1;
	}
	return rez;
}

int main() {
	assert(freopen(InFile, "r", stdin));
	assert(freopen(OuFile, "w", stdout));
	scanf("%d%d%d", &N, &L, &U);
	for (int i = 0; i < N; ++i)
		scanf("%u", &v[i]);
	printf("%lld\n", ans(U) - ans(L - 1));
	return 0;
}