#include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> s;
// using namespace __gnu_pbds;
using i64 = long long;
using namespace std;
const int N = 2e5 + 5;
// const int B = 455;
// const int M = 1e4 + 5;
// const int base = 1753591;
// const int mod = 998244353;
const int mod = 1e9 + 7;
// const double pi = acos(-1)

i64 k;
string l, r;
int cnt[4], a[4] = {2, 3, 5, 7}, dig[22], len;
map<array<int, 4>, int> dp[22][2][2][2];
array<int, 4> b[12];
array<int, 4> operator+(array<int, 4> &a, array<int, 4> &b)
{
    array<int, 4> res;
    for (int i = 0; i < 4; i++)
        res[i] = min(cnt[i], a[i] + b[i]);
    return res;
}
int dfs(int cur, int lim, int zero, int flg, array<int, 4> num)
{
    if (dp[cur][lim][zero][flg].count(num))
        return dp[cur][lim][zero][flg][num];
    if (cur == len)
    {
        if (zero || flg)
            return dp[cur][lim][zero][flg][num] = 1;
        else
        {
            int flag = 1;
            for (int j = 0; j < 4; j++)
                if (num[j] < cnt[j])
                    flag = 0;
            return dp[cur][lim][zero][flg][num] = flag;
        }
    }
    int res = 0;
    for (int i = 0; i <= (lim ? dig[cur] : 9); i++)
    {
        array<int, 4> tmp = num + b[i];
        if (i == 0)
            res = (res + dfs(cur + 1, lim == 1 && (dig[cur] == i), zero, flg == 1 || zero == 0, tmp)) % mod;
        else
            res = (res + dfs(cur + 1, lim == 1 && (dig[cur] == i), 0, flg, tmp)) % mod;
    }
    return dp[cur][lim][zero][flg][num] = res;
}
void solve()
{
    cin >> k >> l >> r;
    __int128_t ll = 0;
    for (char c : l)
        ll = ll * 10 + c - '0';
    ll--;
    b[2] = {1, 0, 0, 0};
    b[3] = {0, 1, 0, 0};
    b[4] = {2, 0, 0, 0};
    b[5] = {0, 0, 1, 0};
    b[6] = {1, 1, 0, 0};
    b[7] = {0, 0, 0, 1};
    b[8] = {3, 0, 0, 0};
    b[9] = {0, 2, 0, 0};
    for (int i = 0; i < 4; i++)
    {
        while (k % a[i] == 0)
        {
            cnt[i]++;
            k /= a[i];
        }
    }
    if (k > 1)
    {
        cout << 0;
        return;
    }
    for (int i = 0; i < r.length(); i++)
        dig[i] = r[i] - '0';
    len = r.length();
    int ans = dfs(0, 1, 1, 0, {0, 0, 0, 0});
    for (int i = 0; i < 22; i++)
        for (int j = 0; j < 2; j++)
            for (int k = 0; k < 2; k++)
                for (int l = 0; l < 2; l++)
                    dp[i][j][k][l].clear();
    len = 0;
    while (ll)
    {
        dig[len++] = ll % 10;
        ll /= 10;
    }
    reverse(dig, dig + len);
    ans = (ans + mod - dfs(0, 1, 1, 0, {0, 0, 0, 0})) % mod;
    cout << ans << '\n';
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    cout << fixed << setprecision(10);
    while (t--)
        solve();
}