#include<bits/stdc++.h>
#define int long long
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
template<typename T>istream&operator>>(istream&I,vector<T>&v){for(auto&i:v)I>>i;return I;}
template<typename T>ostream&operator<<(ostream&O,vector<T>&v){for(auto&i:v)O<<i<<' ';return O;}
namespace AC{
const int mod=1e9+7;
void solve(){
	int n,l,r,res=0;
	cin>>n>>l>>r;
	vector<int>dp(n);
	dp[0]=1;
	for(int x=2;x<=r;x*=2){
		vector<int>tmp(n);
		for(int i=1;i<n;i++)tmp[i]=((n-i)*tmp[i-1]+dp[i-1])%mod;
		dp=tmp;
		if(l<=x)(res+=dp[n-1])%=mod;
	}
	cout<<res;
}
}
signed main(){
	int t=1;
	//cin>>t;
	while(t--)AC::solve();
}