import java.util.Scanner;

public class Main{
	private long MOD = 1000000007;
	private long calc(char[] n, int p){
		long dp[][][];
		dp = new long[2][p][16];
		dp[0][0][0] = 1;
		int u = 0;
		int v = 1;
		int sz = n.length;
		for(int i=0; i<sz; i++){
			int k = n[i] - '0';
			for(int j=0; j<(i<sz-5?1:p); j++){
				for(int a=0;a<2;a++){
				for(int b=0;b<3;b++){
				for(int c=0;c<2;c++){
					int s = (a<<3)|(b<<1)|c;
					long val = dp[u][j][s];
					dp[u][j][s] = 0;
					for(int d=0;d<10;d++){
						if(a==0 && d>k) continue;
						int a_ = a | (d<k?1:0);
						int b_ = (b+d)%3;
						int c_ = c | (d==3?1:0);
						int s_ = (a_<<3)|(b_<<1)|c_;
						int j_ = (i<sz-5?0:(j*10+d)%p);
						dp[v][j_][s_] += val;
						if(dp[v][j_][s_]>=MOD) dp[v][j_][s_] -= MOD;
					}
				}}}
			}
			u ^= 1;
			v ^= 1;
		}
		long ret = 0;

		for(int j=1; j<p; j++){
		for(int a=0;a<2;a++){
		for(int b=0;b<3;b++){
		for(int c=0;c<2;c++){
			if(b!=0 && c==0) continue;
			int s = (a<<3)|(b<<1)|c;
			ret += dp[u][j][s];
			if(ret >= MOD) ret-=MOD;
		}}}}

		return ret;
	}

	private void solver(){

		Scanner s = new Scanner(System.in);
		char[] a = s.next().toCharArray();
		char[] b = s.next().toCharArray();
		int p = Integer.parseInt(s.next());

		long ans = calc(b, p);
		ans = (ans - calc(a,p) + MOD) % MOD;
		int x = 0;
		int y = 0;
		int z = 0;
		for(int i=0; i<a.length; i++){
			int k = a[i] - '0';
			x = (x+k)%3;
			y |= k==3?1:0;
			z = (z*10+k)%p;
		}
		if((x==0 || y==1) && z!=0){
			ans += 1;
			ans %= MOD;
		}

		System.out.println(ans);
	}


	public static void main(String[] args){
		Main hoge = new Main();
		hoge.solver();
	}
}