// PhuThuyRuntime <3
// A secret makes a woman woman

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define fo(i, l, r) for(int i = l; i <= r; i++)
#define foi(i, l, r) for(int i = l; i >= r; i--)
#define elif else if
#define el cout << "\n";
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define pil pair<int, ll>
#define fi first
#define se second
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define ll long long
#define pob pop_back
#define bs binary_search
#define vi vector<int>
#define vii vector<pair<int, int>>
#define getbit(i, j) (i >> j) & 1
#define offbit(i, j) (1 << j) ^ i
#define onbit(i, j) (1 << j) | i
const int N = 1e5 + 1;
const ll mod = 1e9 + 7;
const int inf = INT_MAX;
const int base = 31;
const double EPS = 1e-9;
const double pi = acos(-1.0);
int n, L, U;
ll a[20 * N];
void inp(){
    cin >> n >> L >> U;
    fo(i, 1, n) cin >> a[i];
}
void sol(){
    int lo = 1, hi = 1;
    set<ll> s;
    multiset<ll> ms;
    ll ans = 0;
    for(int l = 1, r = 1; r <= n; r++){
        s.insert(a[r]);
        ms.insert(a[r]);
        if(s.size() < L) continue;
        while(s.size() > U){
            if(ms.count(a[l]) == 1){
                ms.erase(a[l]);
                s.erase(a[l]);
            }
            else if(ms.count(a[l]) >= 2){
                ms.erase(ms.find(a[l]));
            }
            l++;
        }
        ans += r - l + 1LL - L + 1;
    }
    cout << ans;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    inp();
    sol();
    return 0;
}