#include <stdio.h>
#include <set>

using namespace std;

#define MN (32768)

int N, n[MN], X, Left, Right;
set<int> c;

int main()
{
	freopen("secv5.in", "r", stdin);
	freopen("secv5.out", "w", stdout);

	int i, j, tmp;
	scanf("%d %d %d", &N, &Left, &Right);
	for(i = 0; i < N; ++ i)
		scanf("%d", &n[i]);

	for(i = 0; i < N; ++ i) {
		c.clear();
		for(j = i; j < N; ++ j) {
			c.insert(n[j]);
			tmp = c.size();
			if(Left <= tmp && tmp <= Right)
				++ X;
		}
	}

	printf("%d\n", X);

	return 0;
}