#include<stdio.h>
#include<string.h>

//#include<vector>
#include<algorithm>
using namespace std;

const int MAXN = 1<<20;

unsigned int nr[MAXN], nr2[MAXN];
int c1[MAXN], c2[MAXN];
int n, l, r;

//vector<pair<int, int> > qq;

int main(void)
{
    freopen("secv5.in", "rt", stdin);
    freopen("secv5.out", "wt", stdout);

    char buf[32];
    unsigned int tmp;
    int siz;
    scanf("%d%d%d\n", &n, &l, &r);
    for (int i=0; i<n; ++i)
    {
/*
        fgets(buf, 32, stdin);
        tmp = 0; siz = strlen(buf);
        if (buf[siz-1] == '\n') --siz;
        for (int j=0; j<siz; ++j)
            tmp = tmp*10+buf[j]-'0';
*/
        scanf("%d", &tmp);
        nr[i] = nr2[i] = tmp;
//        qq.push_back(make_pair(tmp, i));
    }

    // normalizare
    sort(nr2, nr2+n);
    int nn = unique(nr2, nr2+n) - nr2;
    for (int i=0; i<n; ++i)
        nr[i] = lower_bound(nr2, nr2+nn, nr[i]) - nr2;

//    sort(qq.begin(), qq.end());
//    for (int i=0, j=0; i<n; ++i)
//    {
//        if (i>0 && qq[i].first != qq[i-1].first) ++j;
//        nr[qq[i].second]=j;
//    }
/*
    for (int i=0; i<n; ++i)
        printf("%d ", nr[i]);
    printf("\n");
*/

    // deque
    int ix1=0, ix2=0;
    int dif1=0, dif2=0;
    long long sol = 0;
    for (int i=0; i<n; ++i)
    {
        // min elem
        if (!c1[nr[i]]++) ++dif1;
        while (dif1>=l)
        {
            if (!--c1[nr[ix1]]) --dif1;
            ++ix1;
        }

        // max elem
        if (!c2[nr[i]]++) ++dif2;
        while (dif2>r)
        {
            if (!--c2[nr[ix2]]) --dif2;
            ++ix2;
        }

        sol += ix1-ix2;
//        printf("%d %d\n", ix1, ix2);
    }

    printf("%Ld\n", sol);
    return 0;
}