#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    ll n, l, r;
    cin >> n >> l >> r;
    ll fib[1000] = {};
    fib[0] = 1;
    fib[1] = 1;
    srep(i,2,1000){
        fib[i] = fib[i-1] + fib[i-2];
        if(fib[i] > r)break;
    }
    int ff[1000] = {};
    rep(i,1000){
        if(l <= fib[i] && fib[i] <= r){
            ff[i] = 1;
        }
    }
    
    map<ll,int> mp;
    rep(i,1000){
        if(ff[i]){
            
            ll x = fib[i];
            int keta = 0;
            while(x>0){
                keta++;
                x /= 10;
            }
            ll g[keta] = {};
            x = fib[i];
            rep(i,keta){
                g[i] = x % 10;
                x /= 10;
            }
            drep(i,keta){
                x *= 10;
                x += g[i];
                mp[x] = 0;
            }
        }
    }

    rep(i,1000){
        if(ff[i]){
            mp[fib[i]] = 1;
        }
    }

    ll ans = 0;
    const ll MOD = 1000000007;
    map<ll,ll> dp;
    dp[0] = 0;
    rep(i,n){
        map<ll,ll> dp2;
        dp2[0] = 0;
        srep(j,1,10){
            if(mp.find(j) != mp.end()){
                dp2[j] = 1;
            }else{
                dp2[0]++;
            }
        }

        if(i!=0){
            for(auto p : dp){
                if(mp.find(p.first) != mp.end() && mp[p.first] == 1) continue;
                rep(j,10){
                    ll x = p.first * 10 + j;
                    if(mp.find(x) != mp.end()){
                        if(mp[x] == 0){
                            dp2[x] += dp[p.first];
                            dp2[x] %= MOD;
                        }
                    }else{
                        dp2[0] += dp[p.first];
                        dp2[0] %= MOD;
                    }
                }
            }
        }
        /*
        for(auto p : dp2){
            if(mp[p.first] == 0){
                ans += p.second;
                ans %= MOD;
            }
        }
        */

        dp = dp2;
    }

    for(auto p : dp){
        if(mp[p.first] == 0){
            ans += p.second;
            ans %= MOD;
        }
    }
    cout << ans << endl;
    return 0;
}