#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
#include <numeric>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define RE return 0
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
const int mod=(int)1e9+7;
const llint big=(llint)44e15;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
template <class T> void soun(T& ar)
{sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());}
llint gcd(llint a,llint b){if(a%b==0){return b;}else{return gcd(b,a%b);}}
llint lcm(llint a,llint b){return a/gcd(a,b) *b;}
template<class T,class U> auto LB(T& ve,U in){return lower_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto UB(T& ve,U in){return upper_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto LBI(T& ve,U in){return LB(ve,in)-ve.begin();}
template<class T,class U> auto UBI(T& ve,U in){return UB(ve,in)-ve.begin();}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
llint gya(int in){
	llint bgen=in,ans=1;
	for(int h=0;h<30;h++){
		if(((1<<h)&(mod-2))!=0){ans*=bgen;ans%=mod;}
		bgen*=bgen;bgen%=mod;
	}
	return ans;
}
int main(void){
	llint n,i,j;cin>>n;
	llint L,R,ans=0;cin>>L>>R;R++;
	llint l=0,r=0;
	if(R==0){cout<<0<<endl;return 0;}
	if(L==0){ans=1;
		for(i=1;i<n;i++){ans*=i;ans%=mod;}
		ans*=(n-1);ans%=mod;
	}
	while((1LL<<l)<L){l++;}l--;maxeq(l,0);
	while((1LL<<r)<R){r++;}r--;maxeq(r,0);
	n-=2;
	vector<llint>moto(r+1);moto[0]=1;
	for(i=1;i<=n;i++){moto[0]*=i;moto[0]%=mod;}
	for(i=1;i<=n;i++){
		llint g=gya(i);
		for(j=r;j>0;j--){moto[j]+=moto[j-1]*g;moto[j]%=mod;}
	}
	//for(j=0;j<=r;j++){cerr<<moto[j]<<" ";}
	for(j=l;j<r;j++){ans+=moto[j];}
	ans%=mod;cout<<ans<<endl;
	/*
	1; 
	0,    1; 
	0,    1,     1; 
	0,    2,     3,     1; 
	0,    6,    11,     6,    1; 
	0,   24,    50,    35,   10,    1; 
	0,  120,   274,   225,   85,   15,   1; 
	0,  720,  1764,  1624,  735,  175,  21,  1; 
	0, 5040, 13068, 13132, 6769, 1960, 322, 28, 1; 
	*/
	return 0;
}