#include<bits/stdc++.h>
using namespace std;
int a[43],n,l,r,ans;
void Dfs(int p,int sign){
	if(sign>r)return;
	if(sign>=l&&sign<=r)ans++;
	if(p==n){
		if(sign>=l&&sign<=r)ans++;
	}
	Dfs(p+1,sign+a[p]);
	Dfs(p+1,sign);
}
int main(){
	cin>>n>>l>>r;
	for(int i=0;i<n;++i)cin>>a[i];
	Dfs(0,0);
	cout<<ans<<'\n';
}

帮帮忙QwQ