#include <fstream>
#include <unordered_map>
#define ll unsigned int

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

int n,  r,l;
ll v[(1 << 20) + 1];
unordered_map <ll,ll> hs;
long long secv(ll lungime)
{
    hs.clear();
    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 += i - ultim + 1;

    }
    return sol;
}

int main()
{
    f >> n >> l >> r;
    for(int i = 1; i <= n; ++i)
        f >> v[i];
    g << secv(r) - secv(l - 1);
    return 0;
}