#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast ios_base::sync_with_stdio(0);f.tie(0);g.tie(0);
#define setinf(x) memset(x,0x3f3f3f3f,sizeof(x));
#define set0(x) memset(x,0,sizeof(x));
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define fi first
#define se second
#define DD 100001
#define nl '\n'
using namespace std;
const string file="secv5";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
#define int ll
int v[(1<<20)+1],n,k1,k2,d;
unordered_map<int,int>mp;
int solve(int x) {
    int st=1,dr=1,r=0;
    d=0;
    mp.clear();
    while (dr<=n) {
        if (!mp[v[dr]]) ++d;
        mp[v[dr]]++;
        while (d>x) {
            if (mp[v[st]]==1) --d;
            mp[v[st]]--;
            ++st;
        }
        if (st>dr) dr=st;
        else ++dr;
        r+=dr-st;
    }
    return r;
}
signed main(){
    f>>n>>k1>>k2;
    for (int i=1; i<=n; ++i)
        f>>v[i];
    g<<solve(k2)-solve(k1-1);
    system("pause");
    return 0;
}