#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>

using namespace std;

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

const int DIM = (1<<21)+5;

unsigned n,l,u,v[DIM],nrd;

unsigned long long sol;

map <unsigned,unsigned> M;

int main()
{
    fin>>n>>l>>u;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    for(int i=1;i<=n;i++)
    {
        nrd=0;
        for(int j=i;j<=n;j++)
        {
            M[v[j]]++;
            if(M[v[j]]==1)
                nrd++;
            if(nrd>=l && nrd<=u)
                sol++;
        }
        for(int j=i;j<=n;j++)
            M[v[j]]--;
    }
    fout<<sol;
}