#include <bits/stdc++.h>

// #include <atcoder/all>

using namespace std;
// using namespace atcoder;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'



signed main() {
    fio();
    ll n, l, r;
    cin >> n >> l >> r;
    vl f(2);
    f[0] = f[1] = 1;
    for (int i = 2; f.back() <= r; i++) {
        ll x = f[i - 1] + f[i - 2];
        f.push_back(x);
    }

    vector<string> fib;
    rep1 (i, f.size() - 1) {
        if (in(f[i], l, r + 1)) {
            fib.push_back(to_string(f[i]));
        }
    }
    
    // DEBUG_VEC(fib);
    // return 0;

    map<vector<pii>, ll> dp, dp2;
    dp[vector<pii>(0)] = 1;
    ll ans = 0;
    rep (_, n) {
        dp2.clear();
        // DEBUG(dp.size());
        // for (auto itr = dp.begin(); itr != dp.end(); itr++) {
        //     DEBUG_VEC(itr->first);
        //     DEBUG(itr->second);
        // }
        for (auto itr = dp.begin(); itr != dp.end(); itr++) {
            vector<pii> now = itr->first;
            ll x = itr->second;
            rep (i, 10) {
                vector<pii> nex;
                bool flag = true;
                rep (j, now.size()) {
                    int idx = now[j].first, k = now[j].second;
                    if (fib[idx][k] == '0' + i) {
                        if (k == fib[idx].size() - 1) {
                            flag = false;
                            break;
                        }
                        nex.push_back(pii(idx, k + 1));
                    }
                }

                if (not flag) continue;
                rep (j, fib.size()) {
                    if (fib[j][0] == '0' + i) {
                        if (fib[j].size() == 1) {
                            flag = false;
                            break;
                        }
                        nex.push_back(pii(j, 1));
                    }
                }
                if (not flag) continue;
                (dp2[nex] += x) %= MOD;
            }
        }
        swap(dp, dp2);
    }

    for (auto itr = dp.begin(); itr != dp.end(); itr++) {
        (ans += itr->second) %= MOD;
    }
    cout << (ans - 1 + MOD) % MOD << endl;
}