#include <bits/stdc++.h>

using namespace std;

#define FOR(i,s,e) for(int (i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define RFOR(i,e,s) for(int (i)=(e)-1;(i)>=(int)(s);(i)--)
#define RREP(i,e) RFOR(i,0,e)

#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))

typedef long long ll;
typedef pair<int, int> PII;
typedef priority_queue<int> PQI;
typedef priority_queue<PII> PQII;

const double EPS = 1e-10;
const ll mod = 1000000007;
const int N = 2*1000*100;
int n;
ll dp[N+5][2][3][2][8];

ll calc(string x, int p, int less) {
  int pn = -1;  //pn...8:0, 80:1, 800:2
  while (p) {
    pn++;
    p /= 10;
  }

  n = (int)x.size();
  memset(dp, 0, sizeof(dp));
  dp[0][0][0][0][0] = 1;
  REP(i,n) REP(j,2) REP(k,3) REP(l,2) REP(m,8) {
    int lim = j ? 9 : x[i]-'0';
    REP(d,lim+1) {
      (dp[i+1][j || d<lim][(k*10+d)%3][l || d==3][(m*10+d)%8] += dp[i][j][k][l][m]) %= mod;
    }
  }

  ll res = 0;
  REP(j,2) REP(k,3) REP(l,2) REP(m,8) {
    if (less && !j) continue; //[0,a)
    if (!pn && !m) continue;  //pn==0
    if (!k || l) (res += dp[n][j][k][l][m]) %= mod;
  }

  if (pn) {
    REP(j,2) REP(k,3) REP(l,2) {
      if (less && !j) continue; //[0,a)
      if (!k || l) (res += mod - dp[n-pn][j][k][l][0]) %= mod;
    }
  }

  return res;
}

int main() {
  string a, b;
  int p;
  cin >> a >> b >> p;
  printf("%lld\n", (calc(b,p,0)+mod-calc(a,p,1))%mod);
  return 0;
}