#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int f[100005][65];
int main(){
	int n;long long l,r;
	scanf("%d%lld%lld",&n,&l,&r);
	int ans=0;
	if(l==0){
		int cj=n-1;
		for(int i=1;i<=n-1;++i)cj=1ll*cj*i%mod;
		ans=(ans+cj)%mod;++l;
	}
	--n;
	f[0][0]=1;
	for(int i=0;i<n;++i)for(int j=0;j<=60;++j){
		f[i+1][j]=(f[i+1][j]+1ll*i*f[i][j])%mod;
		f[i+1][j+1]=(f[i+1][j+1]+f[i][j])%mod;
	}
	for(int i=0;i<60;++i)if((1ll<<i)>=l&&(1ll<<i)<=r){
		ans=(ans+f[n][i])%mod;
	}
	printf("%d\n",ans);
	return 0;
}