#include <iostream>
#include <map>
#include <unordered_set>
#include <fstream>
using namespace std;
#define nmax (1<<20)+100
ifstream f("secv5.in");
ofstream g("secv5.out");

int n,l,u,op,elem,curent;
unsigned int vect[nmax];
unsigned long long ans;
int main()
{
    f>>n>>l>>u;
    for (int i=1; i<=n; ++i)
        f>>vect[i];
    for (int j=1; j<=n; ++j)
    {
        unordered_set<unsigned int>Ma;
        for (int i=j; i<=n; ++i)
        {
            Ma.insert(vect[i]);
            if (Ma.size()>u)
                break;
            if (Ma.size()>=l&&Ma.size()<=u)
                ++ans;
        }
    }
    g<<ans;
    return 0;
}