#include <fstream>
#include <iostream>
#include <map>
#include <hash_map>
#include <iterator>
#include <algorithm>

#define MAXN ((1<<20) + 1)

using namespace std;
using namespace __gnu_cxx;

unsigned int vec[MAXN];
int minimumSpans[MAXN];
int maximumSpans[MAXN];

int main()
{
    int n, L, U;
    long long numSecv = 0;
    fstream fin("secv5.in", fstream::in);
    fstream fout("secv5.out", fstream::out);
    
    fin >> n >> L >> U;
    //cout << n << " " << L << " " << U << endl;
    
    for (int i=1; i<=n; ++i)
    {
        fin >> vec[i];
        //cout << vec[i] << " ";
    }
    //cout << endl;

    hash_map<int, int> mapDistincts;
    int distincts = 0;
    int span = 1;
    
    for (int i=1; i<=n; ++i)
    {
        mapDistincts[vec[i]]++;
        if (mapDistincts[vec[i]] == 1)
        {
            distincts++;
        }
        
        while (distincts >= L)
        {
            mapDistincts[vec[span]]--;
            if (mapDistincts[vec[span]] == 0)
            {
                distincts--;
            }
            
            span++;
        }
        
        minimumSpans[i] = span;
    }
    
    ostream_iterator<int> itOut(cout, " ");
    //copy(minimumSpans, minimumSpans + n + 1, itOut);
    //cout << endl;
    
    mapDistincts.clear();
    distincts = 0;
    span = 1;
    
    for (int i=1; i<=n; ++i)
    {
        mapDistincts[vec[i]]++;
        if (mapDistincts[vec[i]] == 1)
        {
            distincts++;
        }
        
        while (distincts > U)
        {
            mapDistincts[vec[span]]--;
            if (mapDistincts[vec[span]] == 0)
            {
                distincts--;
            }
            
            span++;
        }
        
        maximumSpans[i] = span;
        
        numSecv += (minimumSpans[i] - span);
    }

    //copy(maximumSpans, maximumSpans + n + 1, itOut);
    //cout << endl;
    
    fout << numSecv << "\n";
    
    return 0;
}