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

using namespace std;

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

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

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

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

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

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

int find(int x)
{
    int h = hash(sir[x]);
    for (int i=0; i<sz(t[h]); ++i)
        if (sir[x] == sir[t[h][i]])
        {
            s[x] = s[t[h][i]];
            return 1;
        }
    return 0;
}

void insert(int x)
{
    int h = hash(sir[x]);
    s[x] = ++ct;
    t[h].pb(x);
}

void solve()
{
    for (i=1; i<=n; ++i)
        if (!find(i))
            insert(i);
    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;
}