#include using namespace std; #define REP(i, n) for(int i = 0;i < n;i++) #define REPR(i, n) for(int i = n;i >= 0;i--) #define FOR(i, m, n) for(int i = m;i < n;i++) #define itrfor(itr,A) for(auto itr = A.begin(); itr !=A.end();itr++) typedef long long llong; char moji[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'}; char moji2[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'}; char moji3[10]={'0','1','2','3','4','5','6','7','8','9'}; #define Sort(a) sort(a.begin(),a.end()); #define Reverse(a) reverse(a.begin(),a.end()); #define print(a) cout << a << endl; #define MOD llong(1e9 +7) #define MAX 2005 int main(){ llong ans[2]; string S[2]; string p; cin >> S[0] >> S[1] >> p; int p_keta = p.length(); REP(iiii,2){ string s; s = S[iiii]; int n = s.length(); int dp[MAX][2][2][3][8][2]; if(iiii == 1) REP(i,n+1) REP(j,2) REP(k,2) REP(ii,3) REP(jj,8) REP(kk,2) dp[i][j][k][ii][jj][kk] = 0; dp[0][0][0][0][0][0] = 1; FOR(i,1,n+1){ REP(iii,2){ if(iii == 1 and i < n + 1 - p_keta) continue; REP(j,2){ REP(ii,2){ REP(jj,3){ REP(kk,8){ int lim = j ? 9 : s[i-1] - '0'; REP(k,lim +1){ dp[i][j or k < lim][ii or k == 3][(jj + k) % 3][(kk * 10 + k)%8][(k == 0 and (iii or (n + 2 - p_keta == i and kk ==0))) or (p_keta == 1 and (10*kk+k)%8 == 0 and i == n)] += dp[i-1][j][ii][jj][kk][iii]; dp[i][j or k < lim][ii or k == 3][(jj+k) % 3][(kk * 10 + k)%8][(k == 0 and (iii or (n + 2 - p_keta == i and kk ==0))) or (p_keta == 1 and (10*kk+k)%8 == 0 and i == n)] %=MOD; } } } } } } } ans[iiii] = 0; REP(i,2){ if(iiii == 0 and i == 0) continue; REP(j,2) REP(k,3) REP(ii,8){ if(j== 0 and k != 0) continue; ans[iiii] += dp[n][i][j][k][ii][0]; ans[iiii] %=MOD; } } } cout << (MOD + ans[1] - ans[0]) % MOD << endl; }