#include <iostream>
#include <fstream>
#include <cstdio>
#include <vector>

const static int NMAX = (1 << 20) + 10;
const static int MODULO = 666013;

using namespace std;

ifstream input("secv5.in");
ofstream output("secv5.out");
int nr_elemente;
int l , u;
unsigned int vect[NMAX];
vector<pair<unsigned int,int> > hashTable[MODULO];

void readDataFromInput()
{
	input >> nr_elemente >> l >> u;
	for (int i = 0; i < nr_elemente ; i++)
		input >> vect[i];
}

void insertOrUpdate(const unsigned int & element)
{
    int key = element % MODULO;
    int i = 0;
    bool was_found = false;

    for (; i<hashTable[key].size() && !was_found; i++)
    {
        if (hashTable[key][i].first == element)
        {
            was_found = true;
            i--;
        }
    }
    if (!was_found)
        hashTable[key].push_back(pair<int,int>(element,1));
    else hashTable[key][i].second++;
}

void decrementValue(const unsigned int & element)
{
    int key = element % MODULO;
    int i = 0;
    bool was_found = false;

    for (; i<hashTable[key].size() && !was_found; i++)
    {
        if (hashTable[key][i].first == element)
        {
            was_found = true;
            i--;
        }
    }
    if (was_found)
        hashTable[key][i].second --;
}

bool valueExists(const unsigned int & element)
{

    int key = element % MODULO;
    int i = 0;
    bool was_found = false;

    for (; i<hashTable[key].size() && !was_found; i++)
    {
        if (hashTable[key][i].first == element)
        {
            was_found = true;
            i--;
        }
    }
    return (was_found && (hashTable[key][i].second > 0));
}

long long nr_secvente(const int & max_diferite)
{
	if (max_diferite == 0) return 0;

    int left = 0;
    int right = 0;
    int nr_diferite = 1;
    long long secvente = 0;
	insertOrUpdate(vect[0]);

    for (left = 0 ; left < nr_elemente; left++)
    {

        while (right < nr_elemente && nr_diferite <= max_diferite)
        {
			right++;
			if (!valueExists(vect[right])) nr_diferite ++;
			insertOrUpdate(vect[right]);
        }
        secvente += 1LL * (right - left);
        decrementValue(vect[left]);
        if (!valueExists(vect[left])) nr_diferite --;
    }
    return secvente;
}

int main()
{
	readDataFromInput();
	output << nr_secvente(u) - nr_secvente(l-1);
	input.close();
	output.close();
    return 0;
}