#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 FOR(i,a,b) for(ll i=(a);i<(b);i++) #define rep(i,n) FOR(i,0,n) using namespace std; ll withMod2DP(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){ //modaで割ってあまりが0, modbで割って、あまりが0じゃない 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; cin >> A >> B; ll n = A.size(); rep(i,n){ if(A[n-i-1]=='0')A[n-i-1]='9'; else{ A[n-i-1]-=1; break; } } ll na = withMod2DP(A, 3, 3, 8); ll nb = withMod2DP(B, 3, 3, 8); if((nb-na)<0) cout << nb-na + MOD << endl; else cout << nb - na << endl; return 0; }