#include <bits/stdc++.h>

#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#endif

#define sz(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define pb push_back
#define pi array<int, 2>

using namespace std;

#define int long long

int dp[60][40][30][25][2][2];
int ndp[60][40][30][25][2][2];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int k; cin >> k;
    string l, r; cin >> l >> r;

    vector<int> p = {2, 3, 5, 7};
    const int mod = (int)1e9 + 7;

    array<int, 4> kid = {0, 0, 0, 0};
    for(int j = 0; j < 4; ++j){
        while(k % p[j] == 0){
            ++kid[j];
            k /= p[j];
        }
    }
    auto sol = [&](string s, int less){
        memset(dp, 0, sizeof(dp));
        dp[0][0][0][0][0][0] = 1;

        int rv = 0;
        array<int, 4> id;
        int zcnt = 0;
        for(int i = 0; i < sz(s); ++i){
            int v = s[i] - '0';

            (zcnt *= 10) %= mod;
            (zcnt += v) %= mod;

            memset(ndp, 0, sizeof(ndp));
            for(id[0] = 0; id[0] < 60; ++id[0]){
                for(id[1] = 0; id[1] < 40; ++id[1]){
                    for(id[2] = 0; id[2] < 30; ++id[2]){
                        for(id[3] = 0; id[3] < 25; ++id[3]){
                            for(int j = 0; j < 2; ++j){
                                for(int nz = 0; nz < 2; ++nz){
                                    if(!dp[id[0]][id[1]][id[2]][id[3]][j][nz]) continue;
                                    for(int now = 0; now < 10; ++now){
                                        if(!j && now > v) break;
                                        if(nz && !now) continue;

                                        // cout << i << ' ' << id[0] << ' ' << id[1] << ' ' << id[2] << ' ' << id[3] << ' ' << j << ' ' << now << endl;

                                        auto nid = id;

                                        if(now){
                                            for(int k = 0; k < 4; ++k){
                                                int imsi = now;
                                                while(imsi % p[k] == 0){
                                                    ++nid[k];
                                                    imsi /= p[k];
                                                }
                                            }
                                        }

                                        (ndp[nid[0]][nid[1]][nid[2]][nid[3]][j | (now < v)][nz | !!now] += dp[id[0]][id[1]][id[2]][id[3]][j][nz]) %= mod;
                                    }
                                }
                            }
                        }
                    }
                }
            }
            for(id[0] = 0; id[0] < 60; ++id[0]){
                for(id[1] = 0; id[1] < 40; ++id[1]){
                    for(id[2] = 0; id[2] < 30; ++id[2]){
                        for(id[3] = 0; id[3] < 25; ++id[3]){
                            for(int j = 0; j < 2; ++j){
                                for(int nz = 0; nz < 2; ++nz){
                                    dp[id[0]][id[1]][id[2]][id[3]][j][nz] = ndp[id[0]][id[1]][id[2]][id[3]][j][nz];
                                }
                            }
                        }
                    }
                }
            }
        }
        if(less) (zcnt += mod - 1) %= mod;

        // cout << zcnt << endl;
        for(id[0] = 0; id[0] < 60; ++id[0]){
            for(id[1] = 0; id[1] < 40; ++id[1]){
                for(id[2] = 0; id[2] < 30; ++id[2]){
                    for(id[3] = 0; id[3] < 25; ++id[3]){
                        for(int j = less; j < 2; ++j){
                            (zcnt += mod - dp[id[0]][id[1]][id[2]][id[3]][j][1]) %= mod;

                            if(k == 1 && id[0] >= kid[0] && id[1] >= kid[1] && id[2] >= kid[2] && id[3] >= kid[3]){
                                (rv += dp[id[0]][id[1]][id[2]][id[3]][j][1]) %= mod;
                            }
                        }
                    }
                }
            }
        }

        (rv += zcnt) %= mod;

        // cout << zcnt << ' ' << rv << endl;

        return rv;
    };

    int ans = (sol(r, 0) - sol(l, 1) + mod) % mod;

    cout << ans;

    return 0;
}