#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int N=100005;
int n,l,r,sig;
ll s[N],ans;
char ch;
inline void read(int &x){x=0;sig=1;ch=getchar();while(ch<48||ch>57){if(ch==45)sig=-1;ch=getchar();}while(ch>47&&ch<58)x=(x<<3)+(x<<1)+(ch^48),ch=getchar();x*=sig;}
void CDQ(int le,int ri)
{
	if(le==ri) return ;
	int mid=(le+ri)/2;
	CDQ(le,mid),CDQ(mid+1,ri);
	sort(s+le,s+mid+1),sort(s+mid+1,s+ri+1);
	int head=le,tail=le-1;
	for(int i=mid+1;i<=ri;++i)
	{
		while(tail+1<=mid&&s[i]-s[tail+1]>=l) ++tail;
		while(head<=mid&&s[i]-s[head]>r) ++head;
		ans+=tail-head+1;
	}
	return ;
}
int main()
{
	freopen("bjoi2016_hzss.in","r",stdin);
	freopen("bjoi2016_hzss.out","w",stdout);
	int k;
	read(n),read(l),read(r);
	for(int i=1;i<=n;++i) read(k),s[i]=k+s[i-1];
	CDQ(0,n);
	printf("%lld\n",ans);
	return 0;
}