using namespace std;

#include <cstdio>
#include <map>
#include <iostream>
#include <cstring>
#include <algorithm>

int N, L, U, cnt[ 1<<20 + 1 ];
unsigned int A[1<<20+2], B[1<<20+2], C[1<<20+2];
map<unsigned int,int> mp;

void resort()
{
     memcpy( B, A, sizeof( A ) );
     
     sort( B + 1, B + N + 1 );   
     
     int nr(0), j;
     
     for( int i = 1; i <= N; i++ ) 
     {
          for( j = i; j <= N && B[j] == B[i]; j++ );
          
          C[++nr] = B[i];
          
          i = j - 1;     
     }
     
     for( int i = 1; i <= N; i++ )
          A[i] = lower_bound( C + 1, C + nr + 1, A[i] ) - C;     
}

long long doit( int LEN )
{
     long long ret = 0;
     
     int r = 0, dist = 0;
     
     bool can;
     
     memset( cnt, 0, sizeof( cnt ) );

     for( int i = 1; i <= N; i++ )
     {
         while( r + 1 <= N  )
         {
                if( !(cnt[ A[r+1] ] || dist + 1 <= LEN ) )
                   break;
                
                dist += !cnt[ A[r+1] ];
                    
                cnt[ A[r+1] ]++;  
                
                ++r;    
         }       
         
         cnt[ A[i] ]--;
         
         if( !cnt[A[i]] )
             dist--;
         
         ret += (long long)( r ) - i + 1;
     }
     
     return ret;
}

int main()
{
    freopen("secv5.in", "r", stdin);
    freopen("secv5.out", "w", stdout);
    
    scanf("%d %d %d", &N, &L, &U);
    for( int i = 1; i <= N; i++ )
         scanf("%ud", A + i );
    
    resort();
    
    cout << doit( U ) - doit( L - 1 ) << endl;
    
    return 0;
}