#include <cstdio>
#include <cstring>
#include <algorithm>
#include <unordered_map>
#define maxN 1048578
using namespace std;
int i, j, n, l, u, w[maxN], sol;

unordered_map < unsigned int, unsigned int > H;
void read()
{
    freopen("secv5.in", "r", stdin);
    scanf("%d %d %d", &n, &l, &u);
    for (i = 1; i <= n; ++ i)
        scanf("%ud", &w[i]);
}
int nrseq(int u)
{
    int sol = 0, nr = 0;
    nr = 1;
    for (i = 1; i <= n; ++ i)
    {
        ++ H[w[i]];
        while (H.size() > u)
        {
            -- H[w[nr]];
            if (H[w[nr]] == 0)
                H.erase(w[nr]);
            ++ nr;
        }
        sol += (i - nr + 1);
    }
    return sol;
}
void solve()
{
    sol = nrseq(u);
    if (l - 1 > 0)
        sol -= nrseq(l - 1);
}
void write()
{
    freopen("secv5.out", "w", stdout);
    printf("%d", sol);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}