#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <numeric>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<((x))<<endl
#define fi first
#define se second

#define INF 2147483600
#define MOD 1000000007
#define long long long


long dp[2][2][2][3][800];
// [-][EQ?][3を使った][mod3][mod8]

long solve(string &s, int q, bool eq=true){
  int n = s.size();

  auto prev = dp[0];
  auto crnt = dp[1];
  fill(prev[0][0][0], prev[2][0][0], 0);
  prev[1][0][0][0] = 1;

  rep(i,n){
    fill(crnt[0][0][0], crnt[2][0][0], 0);
    rep(j,2) rep(k,3) rep(l,q){
      rep(m,10) (crnt[0][j|(m==3)][(k*10+m)%3][(l*10+m)%q] += prev[0][j][k][l]) %= MOD;
      int mx = s[i]-'0';
      rep(m,mx+1) (crnt[m==mx][j|(m==3)][(k*10+m)%3][(l*10+m)%q] += prev[1][j][k][l]) %= MOD;
    }
    swap(prev, crnt);
  }

  long ret = 0;
  rep(i,2) if(i==0 || eq){
    rep(j,3)rep(k,q) if(k!=0) ret = (ret+prev[i][1][j][k])%MOD; // 3を使った
    rep(k,q) if(k!=0) ret = (ret+prev[i][0][0][k])%MOD; // 3を使わずmod3=0
  }
  return ret;
}

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

  long ans = solve(b,p) - solve(a,p, false);
  cout << (ans+MOD)%MOD << endl;

  return 0;
}