#include<stdio.h>
#include<algorithm>

using namespace std;

const int maxn = 1000020;

int i;
int l[maxn];
int n;
int v[maxn];
int a[maxn];
int cnt;
int s;
int t;
int cont[maxn];
int b[maxn];

int calc(int x)
{

        l[0]=1;
        for(i=1;i<=n;i++)
        {
                l[i]=l[i-1];
                v[a[i]]++;
                if (v[a[i]]==1) cnt++;
                while(cnt>x)
                {
                        l[i]++;
                        v[l[i-1]]--;
                        if (v[l[i-1]]==0) cnt--;
                }
        }
        int sum=0;
        for(i=1;i<=n;i++)
                sum+=(1-l[i]+1);

        return sum;
}

int bs(int i)
{
        int p,x=0;
        for(p=1;p<=n;p<<=1);
        for(;p;p>>=1)
                if (b[x+p]<=i&&x+p<=n) x+=p;
        return x;
}


int main()
{
        freopen("secv5.in","r",stdin);
        freopen("secv5.out","w",stdout);
        scanf("%d %d %d",&n,&s,&t);
        for(i=1;i<=n;i++)
        {
                scanf("%d",&a[i]);
                b[i]=a[i];
        }
        sort(b+1,b+n+1);
        for(i=1;i<=n;i++)
        {
                if (b[i]!=b[i-1])
                {
                        cont[i]=cont[i-1]+1;
                }
                else cont[i]=cont[i-1];
        }
        for(i=1;i<=n;i++)
        {
                a[i]=cont[bs(a[i])];
        }
        int sol;
        
        sol=calc(t)-calc(s);
        printf("%d",sol);

        return 0;
}