#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

using namespace std;
int n, x, y;
unsigned int a[1050000];
long long funct(int e) {
    unordered_map<unsigned int, int> m;
    long long ans = 0;
    int dist = 0, l = 1;
    for (int r = 1; r <= n; r++) {
        m[a[r]]++;
        if (m[a[r]] == 1) dist++;
        while (l <= r && dist > e) {
            m[a[l]]--;
            if (m[a[l]] == 0) dist--;
            l++;
        }
        ans += r - l + 1;
    }
    return ans;
}

int main() {
    ifstream cin("secv5.in");
    ofstream cout("secv5.out");

    cin >> n >> x >> y;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    cout << funct(y) - funct(x - 1);
    return 0;
}