#include<bits/stdc++.h>
using namespace std;
typedef __int128_t LLL;
#define V vector
#define pb push_back
typedef unsigned long long ULL;
typedef long long LL;
#define lb lower_bound
#define all0(x) (x).begin(), (x).end()
#define all1(x) (x).begin() + 1, (x).end()

const int mod = 1e9 + 7;
LL MOD(LL x) {
    if(x >= mod) x -= mod;
    if(x < 0) x += mod;
    return x;
}
LL upd(LL k, LL now) {
    if(now == 0) return 1;
    if(now == 4) {
        if(k % 4 == 0) return k / 4;
        if(k % 2 == 0) return k / 2;
        return k;
    }
    if(now == 9) {
        if(k % 9 == 0) return k / 9;
        if(k % 3 == 0) return k / 3;
        return k;
    }
    if(now == 8) {
        if(k % 8 == 0) return k / 8;
        if(k % 4 == 0) return k / 4;
        if(k % 2 == 0) return k / 2;
        return k;
    }
    if(now == 6) {
        if(k % 6 == 0) return k / 6;
        if(k % 2 == 0) return k / 2;
        if(k % 3 == 0) return k / 3;
        return k;
    }
    if(k % now == 0) return k / now;
    return k;
}
map<pair<int, LL>, LL> mp;
LL dfs(int now, LL res) {
    if(now == 0) {
        if(res == 1) return 1;
        return 0;
    }
    if(mp.count({now, res})) return mp[{now, res}];
    LL ans = 0;
    for(int i = 0; i <= 9; i++) {
        LL n_res = upd(res, i);
        ans = MOD(ans + dfs(now - 1, n_res));
    }
    return mp[{now, res}] = ans;
}
LL cal(string s, LL k) {
    reverse(all0(s));
    LL ans = 0;
    for(int i = s.size() - 1; i >= 1; i--) {
        for(int j = 1; j <= 9; j++) {
            LL res = upd(k, j);
            ans = MOD(ans + dfs(i - 1, res));
        }
    }
    // cout << "ans : " << ans << endl;
    for(int i = s.size() - 1; i >= 0; i--) {
        for(int j = (i == s.size() - 1 ? 1 : 0); j < s[i] - '0'; j++) {
            ans = MOD(ans + dfs(i, upd(k, j)));
        }
        k = upd(k, s[i] - '0');
    }
    // if(k == 1) {
    //     cout << "good" << endl;
    // }
    ans += k == 1;
    return ans;
}

bool is_ok(string s, LL k) {
    for(auto c : s) {
        k = upd(k, c - '0');
    }
    return k == 1;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    LL k; cin >> k;
    string l, r; cin >> l >> r;
    LL ans = MOD(cal(r, k) - cal(l, k) + is_ok(l, k));
    cout << ans << endl;

    // cout << (100000000000000) % mod << endl;
    // for(int i = 1; i <= 20; i++) {
        // cout << "i : " << i << " " << cal(to_string(i), 8) << endl;
    // }
    // for(int i = 0; i <= 9; i++) cout << "upd, i : " << i << " " << upd(5, i) << endl;
}
//5,