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

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#define debug(x) cerr << #x << ": " << x << endl
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  2018/10/01  Problem: yukicoder 315  / Link: http://yukicoder.me/problems/no/315  ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----



----解説ここまで---- */


vector<LL> dp[200005][3][2][2];
int EIGHT;
map<int, int>eightDigit = { {8,3},{80,4},{800,5} };
int positiveDigit;
LL f(const string& s, int i, int threemod = 0, int hasthree = 0, int eightmod = 0, bool less = 0) {
	if (i == -1) {
		return (threemod == 0 || hasthree == 1) && eightmod%EIGHT;
	}
	if (dp[i][threemod][hasthree][less].size()==0) {
		if (i + 1 > positiveDigit) {
			dp[i][threemod][hasthree][less].assign(1, -1);
		}
		else {
			dp[i][threemod][hasthree][less].assign(EIGHT, -1);
		}
	}
	else {
		// return memo
		if (i + 1 > positiveDigit) {
			if (less && dp[i][threemod][hasthree][less][0] != -1)return dp[i][threemod][hasthree][less][0];
		}
		else {
			if (less && dp[i][threemod][hasthree][less][eightmod] != -1) {
				return dp[i][threemod][hasthree][less][eightmod];
			}
		}
	}
	LL res = 0;
	int Max = less ? 9 : s[i] - '0';
	FOR(nx, 0, Max + 1) {
		res += f(s, i-1, (threemod + nx) % 3, hasthree || nx == 3, (eightmod * 10 + nx) % EIGHT, less || (nx < Max));
	}
	res %= MOD;
	// return memo
	if (i + 1 > positiveDigit) {
		if (less)return dp[i][threemod][hasthree][less][0] = res;
	}
	else if (less) {
		return dp[i][threemod][hasthree][less][eightmod] = res;
	}
	else {
		return res;
	}
}



int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	string A, B; cin >> A >> B >> EIGHT;
	::positiveDigit = eightDigit[EIGHT];
	FORR(i, SZ(A) - 1, 0 - 1) { // A--;
		if (A[i] == '0') {
			A[i] = '9';
		}
		else {
			A[i]--;
			break;
		}
	}
	if (A[0] == '0')A = A.substr(1);
	reverse(ALL(A)), reverse(ALL(B));
	
	LL ans = f(B, SZ(B) - 1);
	LL ret = f(A, SZ(A) - 1);
	ans -= ret;
	if (ans < 0)ans += MOD;
	cout << ans << "\n";

	return 0;
}