#include <fstream>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <cstring>
#include <map>
#include <string>
#include<iomanip>
#include<bitset>
#include<unordered_map>
#define oo 2000000000
#define MOD 777013
using namespace std;

ifstream fin("secv5.in");
ofstream fout("secv5.out");
int a[150585], l, u, n, k, rez;
unordered_map<int, int>m;
int nrsecv(int k)
{
    int st = 1,dr=1,cnt=0,rez=0;
    m.clear();
    while (dr <= n)
    {
        m[a[dr]]++;
        if (m[a[dr]] == 1)
            cnt++;
        while (cnt > k)
        {
            m[a[st]]--;
            if (m[a[st]] == 0)
                cnt--;
            st++;
        }
        rez += (dr - st + 1);
        dr++;
    }
    return rez;
}
int main()
{
    fin >> n >> l >> u;
    for (int i = 1; i <= n; i++)
    {
        fin >> a[i];
    }
    
    fout<<nrsecv(u)-nrsecv(l-1);
}