#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

#define Nmax 1048576
#define Tmax 1
#define pb push_back
#define sz(a) int((a).size())

int i, j, n, l, u, ct, last;
const int r = 666013;
long long sol;
unsigned int sir[Nmax];
vector<int> t[Tmax];
int v[Nmax];

inline void citire()
{
    scanf("%d %d %d\n", &n, &l, &u);
    for (i=1; i<=n; ++i)
        scanf("%u\n", &sir[i]);
}

inline int hash(unsigned int x)
{
    long long p = x;
    return (p * r) % Tmax;
}

inline long long solve2(int m)
{
    int st = 1, ct = 0, dr;
    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;
    }
    for (; st<=n; ++st)
        --v[sir[st]];
    return ret;
}

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

void solve()
{
    for (i=1; i<=n; ++i)
        t[hash(sir[i])].pb(i);
    for (i=0; i<Tmax; ++i)
        if (sz(t[i]) > 0)
        {
            sort(t[i].begin(), t[i].end(), cmp);
            ++ct;
            last = sir[t[i][0]];
            sir[t[i][0]] = ct;
            for (j=1; j<sz(t[i]); ++j)
            {
                if (sir[t[i][j]] != last)
                   ++ct;
                last = sir[t[i][j]];
                sir[t[i][j]] = ct;
            }
        }
    sol = solve2(u);
    sol -= solve2(l-1);
    printf("%lld\n", sol);
}

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