#include <bits/stdc++.h>
using namespace std;

void justDoIt();

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    justDoIt();
    return 0;
}

const int MOD = 1e9 + 7;
const int K = 21;
const int MAX_C2 = K * 3;
const int MAX_C3 = K * 2;
const int MAX_C5 = K * 1;
const int MAX_C7 = K * 1;
const vector<int> PRIMES = {2, 3, 5, 7};
int a[K];
int cnt[10][4];
int need[4];
int dp[K + 1][2][2][2][MAX_C2 + 1][MAX_C3 + 1][MAX_C5 + 1][MAX_C7 + 1];
long long m;

// f1 - has the number started?
// f2 - is the number already smaller?
// f3 - does the number have a 0?

void add(int& var, int delta) {
    var += delta;
    if (var >= MOD) {
        var -= MOD;
    }
}

int calc(__int128 r) {
    for (int i = K - 1; i >= 0; i--) {
        a[i] = r % 10;
        r /= 10;
    }
    memset(dp, 0, sizeof(dp));
    dp[0][0][0][0][0][0][0][0] = 1;
    for (int i = 0; i < K; i++) {
        for (int f1 = 0; f1 < 2; f1++) {
            for (int f2 = 0; f2 < 2; f2++) {
                for (int f3 = 0; f3 < 2; f3++) {
                    for (int c2 = 0; c2 <= MAX_C2; c2++) {
                        for (int c3 = 0; c3 <= MAX_C3; c3++) {
                            for (int c5 = 0; c5 <= MAX_C5; c5++) {
                                for (int c7 = 0; c7 <= MAX_C7; c7++) {
                                    if (dp[i][f1][f2][f3][c2][c3][c5][c7] == 0) {
                                        continue;
                                    }
                                    for (int d = 0; d < 10; d++) {
                                        if (f2 == 0 && d > a[i]) {
                                            continue;
                                        }
                                        int ni = i + 1;
                                        int nf1 = f1 | (d != 0);
                                        int nf2 = f2 | (d < a[i]);
                                        int nf3 = f3 | (f1 && (d == 0));
                                        int nc2 = c2 + cnt[d][0];
                                        int nc3 = c3 + cnt[d][1];
                                        int nc5 = c5 + cnt[d][2];
                                        int nc7 = c7 + cnt[d][3];
                                        add(dp[ni][nf1][nf2][nf3][nc2][nc3][nc5][nc7], dp[i][f1][f2][f3][c2][c3][c5][c7]);
                                    }
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    int res = 0;
    for (int f1 = 1; f1 < 2; f1++) {
        for (int f2 = 0; f2 < 2; f2++) {
            for (int f3 = 0; f3 < 2; f3++) {
                for (int c2 = 0; c2 <= MAX_C2; c2++) {
                    for (int c3 = 0; c3 <= MAX_C3; c3++) {
                        for (int c5 = 0; c5 <= MAX_C5; c5++) {
                            for (int c7 = 0; c7 <= MAX_C7; c7++) {
                                int cur = dp[K][f1][f2][f3][c2][c3][c5][c7];
                                if (cur == 0) {
                                    continue;
                                }
                                if (f3 == 1) {
                                    add(res, cur);
                                }
                                else if (m == 1) {
                                    if (c2 >= need[0] && c3 >= need[1] && c5 >= need[2] && c7 >= need[3]) {
                                        add(res, cur);
                                    }
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    return res;
}

__int128 toInt(string s) {
    __int128 res = 0;
    for (auto x: s) {
        res = res * 10 + (x - '0');
    }
    return res;
}

void justDoIt() {
    for (int d = 1; d < 10; d++) {
        for (int i = 0; i < 4; i++) {
            int p = PRIMES[i];
            int x = d;
            while (x % p == 0) {
                cnt[d][i]++;
                x /= p;
            }
        }
    }
    cin >> m;
    for (int i = 0; i < 4; i++) {
        int p = PRIMES[i];
        while (m % p == 0) {
            need[i]++;
            m /= p;
        }
    }
    string ls, rs;
    cin >> ls >> rs;
    __int128 l = toInt(ls);
    __int128 r = toInt(rs);
    int res1 = calc(l - 1);
    int res2 = calc(r);
    int res = (res2 + MOD - res1) % MOD;
    cout << res;
}