rt，只有30分pwp，感觉没有问题

//i<=j,sum(i,j)<=r,sum(i,j)>=l
#include<bits/stdc++.h>
using namespace std;
#define int long long
int low,up;//上下界
const int N=2e6+10;
int a[N],s[N];
int n;
int ans;
void cdq(int l,int r){
	if(l==r) return ;
	int mid=l+r>>1;
	cdq(l,mid),cdq(mid+1,r);
	int L=l,R=l-1;
	for(int i=mid+1;i<=r;i++){
		while(R+1<=mid&&s[i]-s[R+1]>=low) R++;
		while(L<=mid&&s[i]-s[L]>up) L++;
		ans+=R-L+1;
	}
	sort(a+l,a+r+1);
}
signed main(){
	cin>>n>>low>>up;
	for(int i=1;i<=n;i++) cin>>a[i],s[i]=s[i-1]+a[i];
	cdq(0,n);
	return cout<<ans,0;
}