#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using namespace std;
typedef long long ll;

const ll mod = 1e9 + 7;
ll dp[202020][2][3][2]; // pos, less, mod 3, three
ll dp2[8][2][3][2][800]; // pos, less, mod 3, three, mod P

template<class T>
T parse(string s) {
	istringstream iss(s);
	T res;
	iss >> res;
	return res;
}

ll f(string N, int P) {
	if (N.length() < 7) {
		int n = parse<int>(N);
		int res = 0;
		rep (i, n + 1) {
			bool three = i % 3 == 0;
			bool eight = i % P == 0;
			int t = i;
			while (t > 0) {
				if (t % 10 == 3) three = true;
				t /= 10;
			}
			if (three && !eight) res++;
		}
		return res;
	}

	memset(dp, 0, sizeof(dp));
	memset(dp2, 0, sizeof(dp2));

	int s = N.length();
	dp[0][0][0][0] = 1;
	rep (i, s - 7) rep (j, 2) rep (k, 3) rep (l, 2) {
		int ub = 9;
		if (!j) ub = N[i] - '0';
		rep (m, ub + 1) {
			(dp[i + 1][j || m < ub][(k + m) % 3][l || m == 3] += dp[i][j][k][l]) %= mod;
		}
	}
	s -= 7;
	rep (j, 2) rep (k, 3) rep (l, 2) {
		dp2[0][j][k][l][0] = dp[s][j][k][l];
	}

	rep (i, 7) rep (j, 2) rep (k, 3) rep (l, 2) rep (m, P) {
		int ub = 9;
		if (!j) ub = N[s + i] - '0';
		rep (x, ub + 1) {
			(dp2[i + 1][j || x < ub][(k + x) % 3][l || x == 3][(m * 10 + x) % P] += dp2[i][j][k][l][m]) %= mod;
		}
	}

	ll res = 0;
	rep (j, 2) rep (k, 3) rep (l, 2) rep (m, P) {
		if ((k == 0 || l) && m != 0) {
			(res += dp2[7][j][k][l][m]) %= mod;
		}
	}
	return res;
}

int main() {
	string A, B;
	int P;
	cin >> A >> B >> P;

	int borrow = 1;
	repr (i, A.length()) {
		int d = A[i] - '0';
		d -= borrow;
		if (d >= 0) borrow = 0;
		else d += 10;
		A[i] = d + '0';
	}
	ll ans = f(B, P);
	ans -= f(A, P);
	ans %= mod; ans += mod; ans %= mod;
	cout << ans << endl;
	return 0;
}