#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");

const int MAX_N = (1<<20) + 5;

int n, lower, upper, v[MAX_N];
pair <int, int> w[MAX_N];

int minval = 1, maxval = INT_MIN, freq[MAX_N];
bool cleaned = false;
void clean(){
    if(!cleaned){
        cleaned = true;
        for(int i=minval; i<=maxval; i++)
            freq[i] = 0;
    }
}

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

        while(st <= i && dif > limit)
            if(--freq[v[st++]] == 0)
                dif--;

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

int main (){
    fin>>n>>lower>>upper;
    for(int i=1; i<=n; i++){
        fin>>v[i];
        w[i] = {v[i], i};
    }

    sort(w+1, w+n+1);
    for(int i=1, cnt=1; i<=n; cnt++, i++){
        maxval = cnt;
        int st = i;
        v[ w[i].second ] = cnt;
        while(i < n && w[st].first == w[i+1].first){
            i++;
            v[ w[i].second ] = cnt;
        }
    }

    fout<<solve(upper) - solve(lower-1);
    return 0;
}