#include <cstdio>
#include <map>

#define NMAX (1 << 20) + 7
#define LL unsigned long long

using namespace std;

int n, l, u;
LL a[NMAX];
map< LL, int > H;

inline int solve(int k){
    int Ans = 0, Number = 0;
    H.clear();
    for(int i = 1, j = 1; i <= n; ++i){
        if(H[a[i]] > 0)
            ++ H[a[i]];
        else{
            ++ Number;
            H[a[i]] = 1;
        }
        while(Number > k){
            -- H[a[j]];
            if(H[a[j]] <= 0)
                -- Number;
            ++j;
        }
        Ans += (i - j + 1);
    }
    return Ans;
}

int main(){
    freopen("secv5.in", "r", stdin);
    freopen("secv5.out", "w", stdout);
    scanf("%d %d %d", &n, &l, &u);
    for(int i = 1; i <= n; ++i)
        scanf("%lld", &a[i]);
    printf("%d\n", solve(u) - solve(l - 1));
    return 0;
}