#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

typedef modint1000000007 mint;
typedef long long ll;

mint solve(string x, bool mode, int p){
  int size = x.size();
  int tp = 3*p;
  vector<mint> dpy(tp);
  vector<mint> dpn(tp);
  bool nowisy = false;
  int nowtp = 0;
  for (int num=0; num<size; num++){
    vector<mint> ndpy(tp);
    vector<mint> ndpn(tp);
    
    //継続
    for (int i=0; i<10; i++){
      if (i==3){
        for (int j=0; j<tp; j++){
          ndpy[(i+10*j)%tp] += dpy[j] + dpn[j];
        }
      }else{
        for (int j=0; j<tp; j++){
          ndpy[(i+10*j)%tp] += dpy[j];
          ndpn[(i+10*j)%tp] += dpn[j];
        }
      }
    }

    //新規
    if (num > 0){
      for (int i=1; i<10; i++){
        if (i==3) ndpy[i] += 1;
        else ndpn[i] += 1;
      }
    }

    int targ = x[num] - '0';

    //解放
    if (nowisy){
      for (int i=(num<1); i<targ; i++){
        ndpy[(i+10*nowtp)%tp] += 1;
      }
    }else{
      for (int i=(num<1); i<targ; i++){
        if (i==3) ndpy[(i+10*nowtp)%tp] += 1;
        else ndpn[(i+10*nowtp)%tp] += 1;
      }
    }

    for (int i=0; i<tp; i++){
      dpn[i] = ndpn[i];
      dpy[i] = ndpy[i];
    }

    if (targ == 3) nowisy = true;
    
    nowtp = (10*nowtp+targ) % tp;
  }

  if (mode){
    if (nowisy) dpy[nowtp] += 1;
    else dpn[nowtp] += 1;
  }

  mint ans = 0;
  for (int i=0; i<tp; i++){
    if (i%p != 0){
      ans += dpy[i];
      if (i%3 == 0) ans += dpn[i];
    }
  }

  return ans;
}

int main(){
  string a, b;
  int p;
  cin >> a >> b >> p;
  mint ans = solve(b,true,p) - solve(a,false,p);
  cout << ans.val() << endl;
}