#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 1e5 + 5, LG = 64;

ll n, l, r;
ll dp[LG][N];

int main() {
//	freopen("function.in", "r", stdin);
//	freopen("function.out", "w", stdout);
	
	cin >> n >> l >> r;
	dp[0][n] = 1;
	for (int i = n - 1; i >= 1; i--) {
		for (int j = 0; j < LG; j++) {
			(dp[j][i] += dp[j][i + 1] * (n - 1 - i)) %= MOD;
			if (j < LG - 1)
				(dp[j + 1][i] += dp[j][i + 1]) %= MOD;
		}
	}
	 
	ll nisend = n - 1;
	for (int i = 1; i <= n - 1; i++)
		(nisend *= i) %= MOD;
	ll ans = (l ? 0 : nisend);
	for (int i = 1; i < LG; i++) {
		if ((1ll << i) < l || r < (1ll << i))
			continue;
		(ans += dp[i][1]) %= MOD;
	}
	cout << ans << endl;
	return 0;
}
//?A?????n?????0?????????(n-1)(n-1)!??????
/*
   *   *   *
A={2 1 4 3 5}
B= 
5 2 1 4 3
2 5 1 4 3
2 4 1 5 3
4 2 1 5 3

?x? max{a1~i}=ai????? 2^{x-1}? 
*/