#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
const ll mod = 1e9 + 7;
template<class T> void add(T &a, T b) {a = (a + b) % mod;}

ll solve(string S, int P){
  ll dp[200005][2][3][2][P];
  rep(i, 200005) rep(j, 2) rep(k, 3) rep(l, 2) rep(m, P) dp[i][j][k][l][m] = 0;
  dp[0][0][0][0][0] = 1;
  rep(i, S.size()) rep(j, 2) rep(k, 3) rep(l, 2) rep(m, P) {
    int x = j ? 9 : S[i] - '0';
    rep(d, x + 1) {
      add(dp[i + 1][j || d < x][(k + d) % 3][l || d == 3][(10 * m + d) % P], dp[i][j][k][l][m]);
    }
  }
  ll ans = 0;
  rep(j, 2) rep(k, 3) rep(l, 2) rep(m, P){
    if((k == 0 || l) && (m != 0)) add(ans, dp[S.size()][j][k][l][m]);
  }
  return ans;
}

int main(){
  string A, B;
  int P;
  cin >> A >> B >> P;
  int a = A[A.size() - 1] - '0';
  A = A.substr(0, A.size() - 1);
  A += ('0' + a - 1);
  ll ans = solve(B, P);
  add(ans, -solve(A, P) + mod);
  cout << ans << endl;
  return 0;
}