#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
 
#define MOD 1000000007
#define ll long long 
#define ld long double
#define rep(i,n) for(ll i =0;i<n;i++)
using namespace std;

ll withModDP(string s, ll _witha, ll _moda,ll _modb){
  ll n = s.size();
  ll dp[n+1][2][2][_moda][_modb]; // keta,less,forbid, mod  _moda, mod _modb
  rep(i,n+1)rep(j,2)rep(k,2)rep(l,_moda)rep(m,_modb) dp[i][j][k][l][m] = 0;
  
  dp[0][0][0][0][0] = 1;
  rep(keta,n)rep(less,2)rep(ng,2)rep(l,_moda)rep(m,_modb){
    int lim = less? 9 : s[keta]-'0';
    rep(d,lim+1)
      (dp[keta+1][less||d<lim][ng||d==_witha][(l+d)%_moda][(m*10+d)%8] += dp[keta][less][ng][l][m])%=MOD;      
  }

  ll result = 0;
  rep(less,2)rep(ng,2)rep(l,_moda)rep(m,_modb){   
    if( (ng || l==0) && m!=0)(result += dp[n][less][ng][l][m])%=MOD;
  }
  return result;
  
}

int main(){ 
  cin.tie(0);
  ios::sync_with_stdio(false);

  string A,B,P;
  cin >> A >> B >> P;
  A[A.size()-1]-=1;

  ll na = withModDP(A,3,3,stoi(P));
  ll nb = withModDP(B,3,3,stoi(P));
  cout << nb - na << endl;
  
}