#include <algorithm>
#include <stdio.h>
#define MAX 1 << 20 + 1
using namespace std;
pair< unsigned, int > v[ MAX ];
unsigned a[ MAX ], f[ MAX ];
int n, st, dr;

long long caca( int limita ){
    long long rez = 0;
    unsigned pipi = 0, cate = 0;
    for( int i = 0; i < n; i++ ){
        if( !f[ a[ i ] ] )
            while( pipi <= i && cate == limita ){
                --f[ a[ pipi ] ];
                if( f[ a[ pipi ] ] == 0 )
                    --cate;
                ++pipi;
            }
        if( f[ a[ i ] ] == 0 )
            ++cate;
        ++f[ a[ i ] ];
        rez += ( long long )i - pipi + 1;
    }
    for( int i = 0; i < n; i++ )
        f[ i ] = 0;
    return rez;
}

int main()
{
    FILE *fin = fopen( "secv5.in", "r" );
    fscanf( fin, "%d%d%d", &n, &st, &dr );
    for( int i = 0; i < n; i++ ){
        fscanf( fin, "%u", &v[ i ].first );
        v[ i ].second = i;
    }
    fclose( fin );
    sort( v, v + n );
    int el = 0;
    a[ v[ 0 ].second ] = el;
    for( int i = 1; i < n; i++ )
        if( v[ i - 1 ].first == v[ i ].first )
            a[ v[ i ].second ] = el;
        else a[ v[ i ].second ] = ++el;
    FILE *fout = fopen( "secv5.out", "w" );
    fprintf( fout, "%lld", caca( dr ) - caca( st - 1 ) );
    fclose( fout );
    return 0;
}