#include <cstdio>
#include <string.h>
#include <algorithm>

using namespace std;

#define Nmax 1050000

int i, j, n, l, u, ct, st, dr, last;
long long sol;
unsigned int sir[Nmax];
int v[Nmax], ind[Nmax];
char s[16];

inline void citire()
{
    scanf("%d %d %d\n", &n, &l, &u);
    for (i=1; i<=n; ++i)
    {
        scanf("%s\n", s);
        for (j=0; j<strlen(s); ++j)
            sir[i] = sir[i]*10 + s[j]-'0';
    }
}

long long solve2(int m)
{
    st = 1;
    ct = 0;
    long long ret = 0;
    for (dr=1; dr<=n; ++dr)
    {
        if (!v[sir[dr]])
            ++ct;
        ++v[sir[dr]];
        while (ct > m)
        {
            if (v[sir[st]] == 1)
                --ct;
            --v[sir[st]];
            ++st;
        }
        ret += dr - st + 1;
    }
    return ret;
}

inline int cmp(const int a, const int b)
{
    return sir[a] < sir[b];
}

void solve()
{
    for (i=1; i<=n; ++i)
        ind[i] = i;
    sort(ind+1, ind+n+1, cmp);
    ct = 1;
    last = sir[ind[1]];
    sir[ind[1]] = ct;
    for (i=2; i<=n; ++i)
    {
        if (sir[ind[i]] != last)
            ++ct;
        last = sir[ind[i]];
        sir[ind[i]] = ct;
    }
    sol = solve2(u);
    memset(v, 0, sizeof(v));
    sol -= solve2(l-1);
    printf("%lld\n", sol);
}

int main()
{
    freopen("secv5.in", "r", stdin);
    freopen("secv5.out", "w", stdout);
    citire();
    solve();
    return 0;
}