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

const long long int MOD = 1000000007LL;
long long int dp[200010][3][8][2][2];

long long int solve(string s, int P, bool include_equal) {
    int d = 0;
    while(P % 10 == 0) d++, P /= 10;

    int N = s.length();
    memset(dp, 0, sizeof(dp));
    dp[0][0][0][0][0] = 1;
    for(int i=0; i<N; i++) {
        for(int mod3=0; mod3<3; mod3++) {
            for(int mod8=0; mod8<8; mod8++) {
                for(int inc3=0; inc3<2; inc3++) {
                    for(int f=0; f<2; f++) {
                        int lim = f ? 9 : s[i] - '0';
                        for(int x=0; x<=lim; x++) {
                            int nmod3 = (mod3 * 10 + x) % 3;
                            int nmod8 = (mod8 * 10 + x) % 8;
                            int ninc3 = (inc3 || x == 3);
                            (dp[i+1][nmod3][nmod8][ninc3][f || x < lim] += dp[i][mod3][mod8][inc3][f]) %= MOD;
                        }
                    }
                }
            }
        }
    }

    long long int ret = 0, maybe_ng = 0;
    for(int mod3=0; mod3<3; mod3++) {
        for(int inc3=0; inc3<2; inc3++) {
            if(mod3 != 0 && inc3 == 0) continue;
            for(int mod8=1; mod8<8; mod8++) {
                (ret += dp[N][mod3][mod8][inc3][1]) %= MOD;
                if(include_equal) {
                    (ret += dp[N][mod3][mod8][inc3][0]) %= MOD;
                }
            }

            (maybe_ng += dp[N][mod3][0][inc3][1]) %= MOD;
            maybe_ng = (maybe_ng - dp[N-d][mod3][0][inc3][1] + MOD) % MOD;

            if(include_equal) {
                (maybe_ng += dp[N][mod3][0][inc3][0]) %= MOD;
                maybe_ng = (maybe_ng - dp[N-d][mod3][0][inc3][0] + MOD) % MOD;
            }
        }
    }
    return (ret + maybe_ng) % MOD;
}

int main() {
    string A, B; int P; cin >> A >> B >> P;
    long long int rr = solve(B, P, 1);
    long long int rl = solve(A, P, 0);
    cout << (rr - rl + MOD) % MOD << endl;
    return 0;
}