#include<bits/stdc++.h>
using namespace std;
int n,l,r;
int foods[10005];
int tot=0;
void dfs(int di,int alls)
{
	if(alls>r)return;
	if(alls>=l&&alls<=r) tot++;
	if(di>n) return;
	dfs(di+1,alls);
	dfs(di+1,alls+foods[di]);
}
int main()
{
	cin>>n>>l>>r;
	for(int i=1;i<=n;i++)
	{
		cin>>foods[i];
	}
	dfs(1,0);
	cout<<tot;
 } 

rt求助