mod = 10**9 + 7
a,b,ps = input().split()
p = int(ps)

def solve(x, mode):
	size = len(x)
	tp = 3*p
	dpy = [0] * tp
	dpn = [0] * tp
	nowisy = 0
	now24 = 0
	for num in range(size):
		ndpy = [0] * tp
		ndpn = [0] * tp
		
		#継続
		for i in range(10):
			if i == 3:
				for j in range(tp):
					ndpy[(i+10*j)%tp] += dpy[j] + dpn[j]
					ndpy[(i+10*j)%tp] %= mod
			else:
				for j in range(tp):
					ndpy[(i+10*j)%tp] += dpy[j]
					ndpy[(i+10*j)%tp] %= mod
					ndpn[(i+10*j)%tp] += dpn[j]
					ndpn[(i+10*j)%tp] %= mod
		
		#新規
		if num > 0:
			for i in range(1, 10):
				if i == 3:
					ndpy[i] += 1
				else:
					ndpn[i] += 1
		
		targ = int(x[num])
		now24 = now24 * 10 % tp
		
		#解放
		if nowisy:
			for i in range(num<1, targ):
				ndpy[(i+now24)%tp] += 1
		else:
			for i in range(num<1, targ):
				if i == 3:
					ndpy[(i+now24)%tp] += 1
				else:
					ndpn[(i+now24)%tp] += 1
		
		for i in range(tp):
			dpn[i] = ndpn[i]
			dpy[i] = ndpy[i]
		
		if targ == 3:
			nowisy = 1
		
		now24 = (now24+targ) % tp
	
	if mode:
		if nowisy:
			dpy[now24] += 1
		else:
			dpn[now24] += 1
	
	ans = 0
	for i in range(tp):
		if i % p != 0:
			ans += dpy[i]
			ans %= mod
			if i % 3 == 0:
				ans += dpn[i]
				ans %= mod
	
	return ans

print((solve(b, 1)-solve(a, 0)) % mod)