#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
int a[N],s[N],l,r,n;
int main()
{
	freopen("bjoi2016_hzss.in","r",stdin);
	freopen("bjoi2016_hzss.out","w",stdout);
	memset(a,0,sizeof(a));
	memset(s,0,sizeof(s));
	cin>>n>>l>>r;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		s[i]=s[i-1]; s[i]+=a[i];
	}
	int ans=0;
	for(int i=1;i<=n;i++)
	{//枚举所有左边界
		int sum=0;
		for(int j=i;j<=n;j++)
		{//滑动右边界
			sum+=a[j];
			if(sum>=l && sum<=r)ans++;
		}
	}
	cout<<ans<<endl;
	return 0;
}