#include <fstream>
#include <unordered_map>
#include <vector>
#include <algorithm>
#define ll unsigned int
#define MOD 666013


using namespace std;
ifstream f("secv5.in");
ofstream g("secv5.out");

int n,  r,l;
ll v[(1 << 20) + 1],v2[(1 << 20) + 1],  hash_size;
unordered_map <ll,ll> norm;


void normalizare()
{
    sort(v2 + 1, v2 + n + 1);
    int p = 0;
    for(int i = 1; i <= n; ++i)
    {
        if(v2[i] != v2[i-1]) p++;
        norm[v2[i]] = p;
    }
}
long long secv(int lungime)
{
    unordered_map <ll,ll> hs;
    long long sol = 0;
    for(int i = 1, ultim = 1; i <= n; ++i)
    {
        hs[v[i]]++;
        while(lungime < hs.size())
        {
            hs[v[ultim]]--;
            if(!hs[v[ultim]]) hs.erase(v[ultim]);
            ultim++;
        }
        sol = sol + (i - ultim + 1);
    }
    return sol;
}
int main()
{
    f >> n >> l >> r;
    for(int i = 1; i <= n; ++i)
    {
        f >> v[i];
        v2[i] = v[i];
    }
    g << secv(r) - secv(l - 1);
    return 0;
}