#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;

ifstream fin("secv5.in");
ofstream fout("secv5.out");

long long arr[10000001];
int n;

long long cnt(int x)
{
    int i, j, nr;
    unordered_map<long long, int> fr;
    long long ans;
    i = j = nr = ans = 0;
    while (j < n)
    {
        fr[arr[j]]++;
        if (fr[arr[j]] == 1) nr++;
        j++;
        while (nr > x)
        {
            fr[arr[i]]--;
            if (fr[arr[i]] == 0) nr--;
            i++;
        }
        ans += j - i;
    }
    return ans;
}

int main()
{
    int l, u;
    fin >> n >> l >> u;
    for (int i = 0; i < n; i++) fin >> arr[i];
    fout << cnt(u) - cnt(l - 1);
    return 0;
}