#include <cstdio>
int N, dp[100009][64], ret, fact = 1, mod = 1000000007; long long L, R;
int main() {
	scanf("%d%d%d", &N, &L, &R);
	dp[0][0] = 1;
	for (int i = 1; i < N; i++) {
		fact = 1LL * fact * i % mod;
		for (int j = 0; j <= 60; j++) dp[i][j] = (1LL * dp[i - 1][j] * (i - 1) + (j >= 1 ? dp[i - 1][j - 1] : 0)) % mod;
	}
	for (int i = 0; i < 60; i++) if (L <= 1LL << i && 1LL << i <= R) ret = (ret + dp[N - 1][i + 1]) % mod;
	if (L == 0) ret = (ret + 1LL * fact * (N - 1)) % mod;
	printf("%d\n", ret);
}