#include <fstream>
#include <tr1/unordered_map>

using namespace std;
using namespace std::tr1;

#define uint unsigned int
#define ll unsigned long long
#define MAX_N 1 << 20

ifstream fin( "secv5.in" );
ofstream fout( "secv5.out" );

uint v[MAX_N];
unordered_map< uint, int > h;

void read( int &n, int &l, int &u ) {
    fin >> n >> l >> u;
    for ( int i = 0; i < n; ++i )
        fin >> v[i];
}

void init( int n ) {
    for ( int i = 0; i < n; ++i )
        if ( h.find( v[i] ) != h.end() )
            h.erase( v[i] );
}

ll solve( int limit, int n ) {
    if ( limit == 0 )
        return 0;

    init( n );

    ll ans = 0;
    int left = 0;

    for ( int i = 0; i < n; ++i ) {
        if ( h.find( v[i] ) == h.end() )
            while ( left <= i && ( int ) h.size() == limit ) {
                --h[v[left]];
                if ( h[v[left]] == 0 )
                    h.erase( v[left] );

                ++left;
            }

        ++h[v[i]];

        ans += ( ll ) i - left + 1;
    }

    return ans;
}

int main() {
    int n, l, u;
    read( n, l, u );

    ll ans = solve( u, n ) - solve( l - 1, n );

    fout << ans;
}