#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxN 1048578
using namespace std;
int i, j, n, l, u, w[maxN], nr, sol, x, pos[maxN];
int used[maxN];
struct elem
{
    unsigned int x;
    int y;
}v[maxN];
int cmp(const elem a, const elem b)
{
    return a.x < b.x;
}
void read()
{
    freopen("secv5.in", "r", stdin);
    scanf("%d %d %d", &n, &l, &u);
    for (i = 1; i <= n; ++ i)
    {
        scanf("%ud", &v[i].x);
        v[i].y = i;
    }
}
int nrseq(int u)
{
    int sol = 0, nr = 0;
    memset(used, 0, sizeof(used));
    memset(pos, 0, sizeof(pos));
    for (i = 1; i <= n; ++ i)
    {
        if (used[w[i]] < nr - u + 1 || !used[w[i]])
        {
            ++ nr;
            pos[nr] = i;
            used[w[i]] = nr;
        }
        if (nr >= u)
           sol += (i - pos[nr - u + 1] + 1);
        else
            sol += i;
    }
    return sol;
}
void solve()
{
    sort(v + 1, v + n + 1, cmp);
    i = 1; nr = 0;
    while (i <= n)
    {
        ++ j;
        w[v[i].y] = j;
        ++ i;
        while (v[i].x == v[i - 1].x && i <= n)
        {
            w[v[i].y] = j;
            ++ i;
        }
    }
    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;
}