#include <cmath>
#include <iostream>
#include <vector>
using namespace std;

constexpr int mod = static_cast<int>(powl(10, 9)) + 7;

int f(const string &s, const int P) {
  const int length = static_cast<int>(log10(P)) + 1;
  const int n = static_cast<int>(s.size());
  // dp[未満フラグ][has3][mod 3][mod P] := パターン数
  vector<vector<vector<vector<int>>>> dp(2, vector<vector<vector<int>>>(2, vector<vector<int>>(3, vector<int>(P, 0))));
  vector<vector<vector<vector<int>>>> ndp;
  dp[0][0][0][0] = 1;
  for(int i=0; i<n; ++i) {
    const bool upper = i < n-(2+length);
    const int LIM = upper ? 1 : P;
    ndp.assign(2, vector<vector<vector<int>>>(2, vector<vector<int>>(3, vector<int>(P, 0))));
    for(int less=0; less<2; ++less) {
      for(int has3=0; has3<2; ++has3) {
        for(int rem3=0; rem3<3; ++rem3) {
          for(int remP=0; remP<LIM; ++remP) {
            if(!dp[less][has3][rem3][remP]) { continue; }
            for(int d=0; d<=(less ? 9 : s[i]-'0'); ++d) {
              int nless = less || d < s[i] - '0',
                  nhas3 = has3 || d == 3,
                  nrem3 = (rem3 + d) % 3,
                  nremP = remP;
              if(!upper) { nremP = (remP * 10 + d) % P; }
              ndp[nless][nhas3][nrem3][nremP] += dp[less][has3][rem3][remP];
              ndp[nless][nhas3][nrem3][nremP] %= mod;
            }
          }
        }
      }
    }
    swap(dp, ndp);
  }
  int res = 0;
  for(int less=0; less<2; ++less) {
    for(int remP=1; remP<P; ++remP) {
      res += dp[less][0][0][remP];
      res %= mod;
      for(int rem3=0; rem3<3; ++rem3) {
        res += dp[less][1][rem3][remP];
        res %= mod;
      }
    }
  }
  return res;
}

void minus1(string *s) {
  int n = static_cast<int>(s->size());
  for(int i=n-1; i>=0; --i) {
    if(s->at(i) == '0') {
      s->at(i) = '9';
    } else {
      --s->at(i);
      break;
    }
  }
}

int main(void) {
  string a, b; cin >> a >> b;
  minus1(&a);
  int P; scanf("%d", &P);
  int res = f(b, P) - f(a, P);
  res += mod;
  res %= mod;
  printf("%d\n", res);
  return 0;
}