#include <bits/stdc++.h>
using namespace std;
#define int long long
using sit = string::iterator;
const int pri[] = {2, 3, 5, 7};
const int p = 1e9 + 7;
int f[24][70][45][32][26][2];
inline vector<int> Dec(vector<int> cnt, int val, int pz) {
    if (!pz && val == 0) return {0, 0, 0, 0, 0};
    if (val == 0) return cnt;
    for (int i = 0; i < 4; ++i) {
        while (cnt[i] && val % pri[i] == 0) val /= pri[i], --cnt[i];
    }
    return cnt;
}
inline int Dp(sit cur, sit ed, vector<int> cnt, int pz, int lim) {
    if (cur == ed) {
        return cnt == vector<int>({0, 0, 0, 0, 0});
    }
    int &fv = f[ed - cur][cnt[0]][cnt[1]][cnt[2]][cnt[3]][cnt[4]];
    if (!pz && !lim && fv != -1) return fv;
    int ans = 0;
    int vr = lim ? *cur - '0' : 9;
    for (int i = 0; i <= vr; ++i) {
        ans += Dp(next(cur), ed, Dec(cnt, i, pz), pz && i == 0, lim && i == vr);
    }
    ans %= p;
    if (!pz && !lim) fv = ans;
    return ans;
}
signed main() {
    memset(f, -1, sizeof f);
    int k;
    string L, R;
    cin >> k >> L >> R;
    vector<int> cnt(5);
    {
        int tk = k;
        for (int i = 0; i < 4; ++i) {
            while (tk % pri[i] == 0) tk /= pri[i], ++cnt[i]; 
        }
        if (tk > 1) ++cnt[4];
    }
    int ans = Dp(R.begin(), R.end(), cnt, 1, 1);
    // cout << ans << endl;
    ans -= Dp(L.begin(), L.end(), cnt, 1, 1);
    {
        int tk = k;
        for (auto c : L) tk = tk / __gcd(tk, (int)(c - '0'));
        if (tk == 1) ++ans;
    }
    ans = (ans % p + p) % p;
    cout << ans << endl;
    return 0;
}