#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

#define MOD 1000000007

int P;

long long func(string& s){

	//dp[mod_P][lower | has3 | mod3]
	
	vector<vector<long long>> dp (P, vector<long long>(16, 0));
	vector<vector<long long>> dp_(P, vector<long long>(16, 0));

	int keta;
	int tmp = P;
	int two = 0;
	int five = 0;
	while(tmp%2==0){
		tmp/=2;
		two++;
	}
	while(tmp%5==0){
		tmp/=5;
		five++;
	}
	keta = max(two, five);

	dp[0][0b0000] = 1;

	for(int i=0; i<s.size(); i++){
		for(int j=0; j<( (s.size()-i< keta) ?P:1); j++){
			fill(dp_[j].begin(), dp_[j].end(), 0);
		}

		for(int lower=0; lower<2; lower++)
		for(int has3=0; has3<2; has3++)
		for(int mod3=0; mod3<3; mod3++)
		{
			int state = (lower<<3) | (has3<<2) | mod3;
			for(int d=0; d<10; d++){
				if(lower==0 && d>s[i]-'0') continue;
				int next_state = (lower || d<s[i]-'0')<<3;
				next_state |= (has3 || d==3)<<2;
				next_state |= (mod3*10+d)%3;

				if(s.size()-i > keta){
					long long& dp_now = dp[0][state];
					long long& dp_next = dp_[0][next_state];
					dp_next += dp_now;
					if(dp_next>=MOD) dp_next -= MOD;

				}else for(int mod_P=0; mod_P<P; mod_P++){
					long long& dp_now  = dp[mod_P][state];
					long long& dp_next = dp_[(mod_P*10+d)%P][next_state];
					dp_next += dp_now;
					if(dp_next>=MOD) dp_next -= MOD;
				}
			}
		}

		swap(dp, dp_);
	}

	long long ret = 0;
	for(int mod_P=1; mod_P<P; mod_P++){
		if(mod_P % P == 0) continue;

		for(int lower=0; lower<2; lower++)
		for(int has3=0; has3<2; has3++)
		for(int mod3=0; mod3<3; mod3++)
		{
			int state = (lower<<3) | (has3<<2) | mod3;
			if( has3==0 && mod3!=0 ) continue;
			ret += dp[mod_P][state];
			if(ret>=MOD) ret -= MOD;
		}
	}

	return ret;
}

int main(){
	string a,b;
	cin >> a >> b;
	cin >> P;
	

	long long ans = 0;
	ans += func(b);
	ans -= func(a);
	ans = (ans+MOD)%MOD;

	int mod3 = 0;
	int has3 = 0;
	int mod_P = 0;
	for(int i=0; i<a.size(); i++){
		if(a[i] == '3') has3 = 1;
		mod3 = (mod3*10 + a[i]-'0') % 3;
		mod_P = (mod_P*10 + a[i]-'0') % P;
	}
	if( (mod3==0 || has3==1) && mod_P!=0 ) ans += 1;

	ans = (ans+MOD)%MOD;

	cout << ans << endl;

	return 0;
}