#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], 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("%u", &v[i].x);
        v[i].y = i;
    }
}
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;
        }
    }

    for (i = 1; i <= n; ++ i)
    {
        if (!used[w[i]])
            ++ nr;
        while (w[i + 1] == w[i] && i + 1 <= n)
            ++ used[w[i]],
               ++ i;

        pos[nr] = i;
        if (nr >= u)
           sol += i - pos[nr - u] + 1;
        else
            sol += i + 1;
        if (nr >= l - 1)
            sol -= (i - pos[nr - l + 1]);
        else
            sol -= i;
    }
}
void write()
{
    freopen("secv5.out", "w", stdout);
    printf("%d", sol);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}