#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>

using namespace std;

ifstream fin ("secv5.in");
ofstream fout ("secv5.out");

int n, l, u;
unsigned int v[1004141];

void read()
{
    fin >> n >> l >> u;
    for (int i=0;i<n;++i)
    {
        fin >> v[i];
        //cout << v[i] << endl;
    }
}

long long solve(int x)
{
    unordered_map <unsigned int, int> m;
    long long indi=0, indj=0, c=0, nr=0;
    while (indj<n)
    {
        if (m[v[indj]]==0)
            c++;
        m[v[indj]]++;
        while (c>x)
        {
            m[v[indi]]--;
            if (m[v[indi]]==0)
            {
                c--;
                m.erase(v[indi]);
            }
                indi++;
        }
        if (c<=x)
            nr+=indj-indi+1;
        indj++;
    }
    return nr;
}

int main()
{
    read();
    fout << solve(u)-solve(l-1);
    return 0;
}