#include <stdio.h>

#define MOD 1000000007
#define MAX 200001

char a[MAX + 1], b[MAX + 1];
int p;

long long int dp[MAX][6];

int has3_f(int n) {
	while(n != 0) {
		if(n % 10 == 3) { return 1; }
		n /= 10;
	}
	return 0;
}

void pre(int q) {
	int i, j, d = 1;
	for(i = 0; i < q; i++) { d *= 10; }
	for(i = 0; i < d; i++) {
		if(i % p != 0) { dp[q][ 3 * has3_f(i) + i % 3 ]++; }
	}
	
	// i < q は  0初期化されている
	for(i = q; i < MAX - 1; i++) {
		long long int t012 = (dp[i][0] + dp[i][1] + dp[i][2]) * 3 % MOD;
		long long int t345 = (dp[i][3] + dp[i][4] + dp[i][5]) * 3 % MOD;
		long long int t[3] = {
			(dp[i][0] + dp[i][3]) % MOD, 
			(dp[i][1] + dp[i][4]) % MOD, 
			(dp[i][2] + dp[i][5]) % MOD
		};
		
		for(j = 0; j < 3; j++) {
			dp[i + 1][j] = t012;
			dp[i + 1][j + 3] = (t345 + t[j]) % MOD;
		}
	}
	
	return;
}

int f(char s[], int q) {
	int i = 0, j, k, len;
	while(s[i] != '\0') { i++; }
	len = i;
	
	long long int ans = 0;
	int mod3 = 0, has3 = 0;
	
	for(i = 0; i < len - q; i++) {
		int si = s[i] - '0';
		for(j = 0; j < si; j++) {
			for(k = 0; k < 3; k++) {
				if( has3 || j == 3 || (mod3 + j + k) % 3 == 0 ) { ans += dp[len-1 - i][k]; }
				ans += dp[len-1 - i][k + 3];
			}
			ans %= MOD;
		}
		mod3 = (mod3 + si) % 3;
		if(si == 3) { has3 = 1; }
	}
	
	int base = 1, lim = 0, r = (len < q ? len : q);
	for(i = 1; i <= r; i++) {
		lim += (s[len - i] - '0')  * base;
		base *= 10;
	}
	
	for(i = 0; i <= lim; i++) {
		if( i % p != 0 && ( (mod3 + i) % 3 == 0 || has3 || has3_f(i) ) ) { ans++; }
	}
	
	return ans % MOD;
}

int main(void) {
	scanf("%s%s%d", a, b, &p);
	
	int q = 3;
	if(p ==  80) { q = 4; }
	if(p == 800) { q = 5; }
	
	// a--;
	int i = 0;
	while(a[i + 1] != '\0') { i++; }
	while(a[i] == '0') { a[i] = '9'; i--; }
	a[i]--;
	
	pre(q);
	
	int v = ( f(b, q) - f(a, q) + MOD ) % MOD;
	printf("%d\n", v );
	
	return 0;
}