#include <bits/stdc++.h>

using namespace std;

template<ranges::range T, class = enable_if_t<!is_convertible_v<T, string_view>>>
istream& operator>>(istream &s, T &&v) { for (auto &&x : v) s >> x; return s; }
template<ranges::range T, class = enable_if_t<!is_convertible_v<T, string_view>>>
ostream& operator<<(ostream &s, T &&v) { for (auto &&x : v) s << x << ' '; return s; }

#ifdef LOCAL
template<class... T> void dbg(T... x) { char e{}; ((cerr << e << x, e = ' '), ...); }
#define debug(x...) dbg(#x, '=', x, '\n')
#else
#define debug(...) ((void)0)
#endif

#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ff first
#define ss second

template<class T> inline constexpr T inf = numeric_limits<T>::max() / 2;
template<class T> bool chmin(T &a, T b) { return (b < a and (a = b, true)); }
template<class T> bool chmax(T &a, T b) { return (a < b and (a = b, true)); }

using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;

constexpr i64 mod = 1e9 + 7;

void solve() {
    i64 k;
    string L, R;
    cin >> k >> L >> R;

    using state = array<i64, 4>;

    // v[0] == -1 : 0
    // v[0] == -2 : empty
    auto upd = [&](state v, int x) -> state {
        if (v[0] == -1) return v;
        if (v[0] == -2) v[0] = 0;
        if (x == 0) return state{-1, 0, 0, 0};
        for (int i = 0; int p : {2, 3, 5, 7}) {
            int c = 0;
            while (x % p == 0) {
                c++;
                x /= p;
            }
            v[i] += c;
            i++;
        }
        return v;
    };

    auto DP = [&upd](string_view S, bool e) -> map<state, i64> {
        array<map<state, i64>, 2> dp{};
        dp[1][state{-2, 0, 0, 0}] = 1;
        
        for (char c : S) {
            int d = c - '0';
            
            decltype(dp) f{};
            for (const auto &[t, v] : dp[0]) {
                for (int i = (t[0] == -2 ? 1 : 0); i <= 9; i++) {
                    (f[0][upd(t, i)] += v) %= mod;
                }
            }
            for (const auto &[t, v] : dp[1]) {
                for (int i = (t[0] == -2 ? 1 : 0); i <= d; i++) {
                    (f[i == d][upd(t, i)] += v) %= mod;
                }
            }
            
            f[0][state{-2, 0, 0, 0}] = 1;
            f.swap(dp);
        }

        if (e) {
            for (const auto &[s, v] : dp[1]) {
                (dp[0][s] += v) %= mod;
            }
        }

        return dp[0];
    };

    auto dpR = DP(R, 1);
    auto dpL = DP(L, 0);

    for (auto &[s, v] : dpL) {
        (dpR[s] += mod - v) %= mod;
    }

    auto cur = [&]() {
        state cur{0, 0, 0, 0};
        for (int i = 0; int p : {2, 3, 5, 7}) {
            int c = 0;
            while (k % p == 0) {
                c++;
                k /= p;
            }
            cur[i] += c;
            i++;
        }
        return cur;
    }();

    // debug(k, cur);

    i64 ans = 0;
    for (auto &[s, v] : dpR) {
        // debug(s, v);
        if (k == 1 and s[0] != -1) {
            bool ok = true;
            for (int i = 0; i < 4; i++)
                ok &= (s[i] >= cur[i]);
            if (ok) ans += v;
        }
        if (s == state{-1, 0, 0, 0}) {
            ans += v;
        }
        ans %= mod;
    }

    cout << ans << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}