#include <stdio.h>
#include <vector>

using namespace std;

#define pb push_back
#define sz(a) int((a).size())

const int Nmax = 1048576;
const unsigned int r = 2654435761u;
const int Tmax = 196613;

int n, l, u;
long long sol;
unsigned int sir[Nmax];
vector<int> t[Tmax];
int s[Nmax];
short v[Nmax];

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

inline long long solve2(int m)
{
    long long ret = 0;
    int st, dr, ct, lim = n - 1;
    st = 0;
    ct = 0;
    for (dr = 0; dr <= lim; ++dr)
    {
        if (!v[s[dr]])
            ++ct;
        ++v[s[dr]];
        while (ct > m)
        {
            if (!(--v[s[st]]))
                --ct;
            ++st;
        }
        ret += dr - st + 1;
    }
    if (m == u)
        memset(v, 0, sizeof(v));
    return ret;
}

inline void solve()
{
    int i, vl, find, h, ct = 0, lim = n - 1;
    vector<int> :: iterator it;
    for (i = 0; i <= lim; ++i)
    {
        vl = sir[i];
        h = (vl * r) % Tmax;
        find = 0;
        for (it = t[h].begin(); it != t[h].end(); ++it)
            if (vl == sir[*it])
            {
                s[i] = s[*it];
                find = 1;
                break;
            }
        if (!find)
        {
            t[h].pb(i);
            s[i] = ++ct;
        }
    }
    sol = solve2(u) - solve2(l-1);
    printf("%lld\n", sol);
}

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