#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv5.in");
ofstream fout("secv5.out");
int n, l, r, v[1048586], fr[1048586], z, anterior = -1;
unordered_map <int, int> h;
long long ans = 0;
int main()
{
    fin >> n >> l >> r;
    for (int i = 1; i <= n; ++i)
    {
        int x;
        fin >> x;
        if (anterior == x)
            fr[z]++;
        else
            v[++z] = x, fr[z] = 1;
        anterior = x;
    }
    for (int i = l; i <= z; ++i)
    {
        int j = i, contor = 0;
        while (j >= 1 && contor <= r)
        {
            h[v[j]]++;
            if (h[v[j]] == 1)
                ++contor;
            if (contor >= l && contor <= r)
            {
                if (i == j)
                {
                    ans = ans + 1LL * (fr[i] * (fr[i] + 1)) / 2;
                }
                else
                {
                    ans = ans + 1LL * fr[i] * fr[j];
                }
            }
            --j;
        }
        if (j == 0)
            j = 1;
        while (j <= n)
        {
            h[v[j]] = 0;
            ++j;
        }
    }
    fout << ans;
    fin.close();
    fout.close();
    return 0;
}