#include #define LLI long long int #define FOR(v, a, b) for(LLI v = (a); v < (b); ++v) #define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v) #define REP(v, n) FOR(v, 0, n) #define REPE(v, n) FORE(v, 0, n) #define REV(v, a, b) for(LLI v = (a); v >= (b); --v) #define ALL(x) (x).begin(), (x).end() #define RALL(x) (x).rbegin(), (x).rend() #define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it) #define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it) #define EXIST(c,x) ((c).find(x) != (c).end()) #define fst first #define snd second #define popcount __builtin_popcount #define UNIQ(v) (v).erase(unique(ALL(v)), (v).end()) #define bit(i) (1LL<<(i)) #ifdef DEBUG #include #else #define dump(...) ((void)0) #endif #define gcd __gcd using namespace std; template constexpr T lcm(T m, T n){return m/gcd(m,n)*n;} template void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost< istream& operator>>(istream &is, vector &v){for(auto &a : v) is >> a; return is;} template bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);} template bool chmax(T &a, const U &b){return (a void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);} struct Init{ Init(){ cin.tie(0); ios::sync_with_stdio(false); } }init; const LLI mod = 1e9+7; template class ModInt{ public: uint64_t val; ModInt(): val(0){} ModInt(int64_t n): val(n>=M ? n%M : n){} inline constexpr ModInt operator+(const ModInt &a) const {return ModInt((val+a.val)%M);} inline constexpr ModInt operator-(const ModInt &a) const {return ModInt((val-a.val+M)%M);} inline constexpr ModInt operator*(const ModInt &a) const {return ModInt((val*a.val)%M);} inline constexpr ModInt operator/(const ModInt &a) const {return ModInt((val*a.inv().val)%M);} inline constexpr ModInt& operator=(const ModInt &a){val = a.val; return *this;} inline constexpr ModInt& operator+=(const ModInt &a){if((val += a.val) >= M) val -= M; return *this;} inline constexpr ModInt& operator-=(const ModInt &a){if(val < a.val) val += M; val -= a.val; return *this;} inline constexpr ModInt& operator*=(const ModInt &a){(val *= a.val) %= M; return *this;} inline constexpr ModInt& operator/=(const ModInt &a){(val *= a.inv().val) %= M; return *this;} inline constexpr bool operator==(const ModInt &a) const {return val==a.val;} inline constexpr bool operator!=(const ModInt &a) const {return val!=a.val;} inline constexpr static ModInt power(LLI n, LLI p){ ModInt ret = 1, e = n; for(; p; e *= e, p >>= 1) if(p&1) ret *= e; return ret; } inline constexpr ModInt power(LLI p) const{return power(val,p);} inline constexpr ModInt inv() const{ int64_t a = val, b = M, u = 1, v = 0; while(b){ int64_t t = a/b; a -= t*b; swap(a,b); u -= t*v; swap(u,v); } u %= M; if(u < 0) u += M; return u; } }; template ModInt operator+(int64_t a, const ModInt &b){return ModInt(ModInt(a)+b.val);} template ModInt operator-(int64_t a, const ModInt &b){return ModInt(ModInt(a)-b.val);} template ModInt operator*(int64_t a, const ModInt &b){return ModInt(ModInt(a)*b.val);} template ModInt operator/(int64_t a, const ModInt &b){return ModInt(ModInt(a)/b.val);} template istream& operator>>(istream &is, ModInt &a){is >> a.val; return is;} template ostream& operator<<(ostream &os, const ModInt &a){ os << a.val; return os;} using mint = ModInt; // dp[桁数][8の剰余][3の剰余][3が既に出現][A> A >> B){ fill_array(dp, 0); reverse(ALL(A)); A.resize(10100, '0'); reverse(ALL(A)); reverse(ALL(B)); B.resize(10100, '0'); reverse(ALL(B)); dp[0][0][0][0][0][0] = 1; REP(i,N){ REP(j,8){ REP(k,3){ REP(p,2){ REP(q,2){ REP(r,2){ REP(x,10){ if((q or A[i]-'0' <= x) and (r or B[i]-'0' >= x)){ dp[i+1][(j*10+x)%8][(k*10+x)%3][x==3 or p][q or A[i]-'0' < x][r or B[i]-'0' > x] += dp[i][j][k][p][q][r]; } } } } } } } } mint ans = 0; FOR(i,1,8){ REP(j,2){ REP(k,2){ ans += dp[N][i][0][0][j][k] + dp[N][i][0][1][j][k] + dp[N][i][1][1][j][k] + dp[N][i][2][1][j][k]; } } } cout << ans << endl; } return 0; }