#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

void test(int n){
    vector<int> p(n);
    iota(p.begin(), p.end(), 0);
    map<vector<int>, int> cnt;
    do{
        auto q = p;
        for(int i = 0; i < n-1; i++){
            if(q[i] > q[i+1]){
                swap(q[i], q[i+1]);
            }
        }
        if(cnt.count(q)){
            cnt[q]++;
        }else{
            cnt[q] = 1;
        }
    }while(next_permutation(p.begin(), p.end()));
    for(auto [q, c]: cnt){
        print_vector(q);
        cout << c << endl;
    }
}

using mint = atcoder::modint1000000007;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; ll l, r; cin >> n >> l >> r;
    auto dp = vec2d(n+1, 63, mint(0));
    dp[0][0] = 1;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < 62; j++){
            if(i+1 != n) dp[i+1][j] += dp[i][j]*i;
            dp[i+1][j+1] += dp[i][j];
        }
    }
    mint ans = 0;
    for(int x = 1; x < 62; x++){
        ll c = 1ll<<(x-1);
        if(l <= c && c <= r) ans += dp[n][x];
    }
    if(l == 0){
        mint f = n-1;
        for(int x = 1; x <= n-1; x++) f *= x;
        ans += f;
    }
    cout << ans << endl;
}