#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
const ll LLINF = (1LL << 60);
const int INF = (1LL << 30);
const int MOD = 10000;
template <typename T>
T &chmin(T &a, const T &b) {
  return a = min(a, b);
}
template <typename T>
T &chmax(T &a, const T &b) {
  return a = max(a, b);
}
template <typename T>
bool IN(T a, T b, T x) {
  return a <= x && x < b;
}
template <typename T>
T ceil(T a, T b) {
  return a / b + !!(a % b);
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &a) {
  out << '(' << a.first << ',' << a.second << ')';
  return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<T> &a) {
  out << '[';
  for (ll i = (ll)0; i < (ll)a.size(); ++i) {
    out << a[i];
    if (i != a.size() - 1) out << ',';
  }
  out << ']';
  return out;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int dp[505][2][505][10][3][3];
signed main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  string a, b;
  int m;
  cin >> a >> b >> m;
  int n = b.size();
  if (n != 1) {
    VI mo(n);
    mo[0] = 1 % m;
    for (ll i = (ll)1; i < (ll)n; ++i) mo[i] = mo[i - 1] * 10 % m;
    dp[0][0][0][0][0][0] = 1;
    for (ll i = (ll)0; i < (ll)n; ++i)
      for (ll j = (ll)0; j < (ll)2; ++j)
        for (ll k = (ll)0; k < (ll)m; ++k)
          for (ll l = (ll)0; l < (ll)10; ++l)
            for (ll x = (ll)0; x < (ll)3; ++x)
              for (ll y = (ll)0; y < (ll)3; ++y) {
                if (!dp[i][j][k][l][x][y]) continue;
                int lim = j ? 9 : b[i] - '0';
                for (ll d = (ll)0; d < (ll)lim + 1; ++d) {
                  int cond = 0;
                  if (y == 1) {
                    if (l < d)
                      cond = 1;
                    else if (l > d)
                      cond = 2;
                  } else if (x == 1) {
                    if (l > d) cond = 2;
                  } else if (x == 2) {
                    if (l < d) cond = 1;
                  }
                  int cond2 = 0;
                  if (y == 0) {
                    if (d) cond2 = 1;
                  } else if (y == 1) {
                    cond2 = 2;
                  } else {
                    cond2 = 2;
                  }
                  (dp[i + 1][j || d < lim][(k + mo[n - 1 - i] * d) % m][d][cond]
                     [cond2] += dp[i][j][k][l][x][y]) %= MOD;
                }
              }
  }
  int ans = 0;
  if (n != 1) {
    for (ll i = (ll)0; i < (ll)2; ++i)
      for (ll j = (ll)0; j < (ll)10; ++j)
        for (ll k = (ll)1; k < (ll)3; ++k)
          for (ll l = (ll)0; l < (ll)3; ++l) {
            if (!dp[n][i][0][j][k][l]) continue;
            (ans += dp[n][i][0][j][k][l]) %= MOD;
          }
    for (ll i = (ll)0; i < (ll)9; ++i) {
      ans += (i + 1) % m == 0;
    }
  } else {
    for (ll i = (ll)0; i < (ll)b[0] - '0'; ++i) {
      ans += (i + 1) % m == 0;
    }
  }
  n = a.size();
  if (n != 1) {
    VI mo(n);
    mo[0] = 1 % m;
    for (ll i = (ll)1; i < (ll)n; ++i) mo[i] = mo[i - 1] * 10 % m;
    memset(dp, 0, sizeof(dp));
    dp[0][0][0][0][0][0] = 1;
    for (ll i = (ll)0; i < (ll)n; ++i)
      for (ll j = (ll)0; j < (ll)2; ++j)
        for (ll k = (ll)0; k < (ll)m; ++k)
          for (ll l = (ll)0; l < (ll)10; ++l)
            for (ll x = (ll)0; x < (ll)3; ++x)
              for (ll y = (ll)0; y < (ll)3; ++y) {
                if (!dp[i][j][k][l][x][y]) continue;
                int lim = j ? 9 : a[i] - '0';
                for (ll d = (ll)0; d < (ll)lim + 1; ++d) {
                  int cond = 0;
                  if (y == 1) {
                    if (l < d)
                      cond = 1;
                    else if (l > d)
                      cond = 2;
                  } else if (x == 1) {
                    if (l > d) cond = 2;
                  } else if (x == 2) {
                    if (l < d) cond = 1;
                  }
                  int cond2 = 0;
                  if (y == 0) {
                    if (d) cond2 = 1;
                  } else if (y == 1) {
                    cond2 = 2;
                  } else {
                    cond2 = 2;
                  }
                  (dp[i + 1][j || d < lim][(k + mo[n - 1 - i] * d) % m][d][cond]
                     [cond2] += dp[i][j][k][l][x][y]) %= MOD;
                }
              }
  }
  if (n != 1) {
    for (ll i = (ll)0; i < (ll)2; ++i)
      for (ll j = (ll)0; j < (ll)10; ++j)
        for (ll k = (ll)1; k < (ll)3; ++k)
          for (ll l = (ll)0; l < (ll)3; ++l) {
            if (!dp[n][i][0][j][k][l]) continue;
            (ans -= dp[n][i][0][j][k][l]) %= MOD;
          }
    for (ll i = (ll)0; i < (ll)9; ++i) ans -= (i + 1) % m == 0;
  } else {
    for (ll i = (ll)0; i < (ll)a[0] - '0'; ++i) {
      ans -= (i + 1) % m == 0;
    }
  }
  bool can = a[0] != a[1];
  bool flag = a[0] < a[1];
  for (ll i = (ll)2; i < (ll)n; ++i) {
    if (flag) {
      if (a[i - 1] > a[i]) {
        flag = false;
      } else {
        can = false;
        break;
      }
    } else {
      if (a[i - 1] < a[i]) {
        flag = true;
      } else {
        can = false;
        break;
      }
    }
  }
  int now = 0;
  for (int i = n - 1; i >= 0; --i) now = (now * 10 + (a[i] - '0')) % m;
  if (now) can = false;
  if (can) ans++;
  cout << ans << endl;
  return 0;
}
