#include<cstdio>
#include<algorithm>
using namespace std;
int n,a,b,i,x;
int v[100001];
long long sum;
int main()
{
    freopen("teams.in","r",stdin);
    freopen("teams.out","w",stdout);
    scanf("%d%d%d",&n,&a,&b);
    for (i=1;i<=n;++i) scanf("%d",&v[i]);
    sort(v+1,v+n+1);
    for (i=1;i<=n && v[i]<a;++i)
    {
        int *p1=lower_bound(v+i+1,v+n+1,a-v[i]);
        int *p2=upper_bound(v+i+1,v+n+1,b-v[i]);
        sum+=(p2-p1);
    }
    printf("%lld",sum);
    return 0;
}