#include <bits/stdc++.h>

using namespace std;

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;
	}
}fin("secv5.in");

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
}fout("secv5.out");

int n, lower, upper, v[(1<<20)+5];

const int HMOD = 666019;
vector <pair<int, int>> _hash[HMOD + 50];
void update(int num, int add){
    int h = num % HMOD;
    for(int i=0; i < (int)_hash[h].size(); i++)
        if(_hash[h][i].first == num){
            _hash[h][i].second += add;
            return;
        }
    _hash[h].push_back({num, add});
}

int query(int num){
    int h = num % HMOD;
    for(int i=0; i < _hash[h].size(); i++)
        if(_hash[h][i].first == num)
            return _hash[h][i].second;
    return 0;
}

bool cleaned = false;
void clean(){
    if(!cleaned){
        cleaned = true;
        for(int i=0; i < HMOD; i++)
            _hash[i].clear();
    }
}

long long solve(int limit){
    long long answer = 0;
    int st = 1, dif = 0;
    for(int i=1; i<=n; i++){
        update(v[i], +1);
        if(query(v[i]) == 1)
            dif++;

        while(st <= i && dif > limit){
            update(v[st], -1);
            if(query(v[st]) == 0)
                dif--;
            st++;
        }

        answer += i-st+1;
    }
    clean();
    return answer;
}

int main (){
    fin>>n>>lower>>upper;
    for(int i=1; i<=n; i++)
        fin>>v[i];
    fout<<solve(upper) - solve(lower-1);
    return 0;
}