#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007

using namespace std;

typedef long long ll;


int add(int a, int b)
{
    ll x = a+b;
    if(x >= mod)
        x -= mod;
    if(x < 0)
        x += mod;
    return x;
}
ll mul(ll a, ll b)
{
    return (a*b) % mod;
}

ll pw(ll a, ll b)
{
    ll ans = 1;
    while(b)
    {
        if(b & 1)
            ans = (ans * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ans;
}

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

unsigned n, L, R, v[(1<<20) + 2], v2[(1<<20) + 2];
map<unsigned, int> mp;
int frq[(1<<20) + 2];
ll seq(int mx)
{
    memset(frq, 0, sizeof(frq));
    int st = 1;
    int dr = 1;
    int countt = 0;
    ll ans = 0;
    while(st <= n)
    {
        while(dr <= n && countt <= mx)
        {
            if(frq[v2[dr]] == 0 && countt == mx)
                break;
            if(frq[v2[dr]] == 0)
                ++countt;
            ++frq[v2[dr]];
            ++dr;
        }
        ans += dr - st;
        --frq[v2[st]];
        if(frq[v2[st]] == 0)
            --countt;
        ++st;
    }
    return ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    f >> n >> L >> R;
    for(int i = 1; i <= n; ++i)
        f >> v[i], v2[i] = v[i];
    sort(v+1, v+n+1);
    int ds = 0;
    for(int i = 1; i <= n; ++i)
    {
        if(v[i] > v[i-1])
            ++ds;
        mp[v[i]] = ds;
    }
    for(int i = 1; i <= n; ++i)
        v2[i] = mp[v2[i]];
    g << seq(R) - seq(L-1) << '\n';
    return 0;
}