#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 >> (unsigned int &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;
	}
};

int n, l, u;
pair<unsigned int, int> v[(1 << 20) + 1];
int cv[(1 << 20) + 1], mt[(1 << 20) + 1];

long long sum(long long k) {
    return k * (k + 1) / 2;
}

long long calcSeq(int len) {
    int st = 1, cvSize = 0;
    long long sol = 0;
    memset(mt, 0, sizeof(mt));
    for (int dr = 1; dr <= n; ++dr) {
        ++mt[cv[dr]];
        if (mt[cv[dr]] == 1) {
            ++cvSize;
        }
        while (cvSize > len) {
            --mt[cv[st]];
            if (mt[cv[st]] == 0) {
                --cvSize;
            }
            ++st;
        }
        sol += dr - st + 1;
    }
    return sol;
}

int main() {
    InParser cin("secv5.in");
    ofstream cout("secv5.out");
    cin >> n >> l >> u;
    for (int i = 1; i <= n; ++i) {
        cin >> v[i].first;
        v[i].second = i;
    }
    sort(v + 1, v + n + 1);
    int k = 0;
    for (int i = 1; i <= n; ++i) {
        if (v[i].first != v[i - 1].first) {
            ++k;
        }
        cv[v[i].second] = k;
    }
    cout << calcSeq(u) - calcSeq(l - 1);
}