#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}


const int mod = 1000000007;
const int max_n = 200005;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  bool operator==(const mint &p) const { return x == p.x; }
  bool operator!=(const mint &p) const { return x != p.x; }
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
}comb(max_n);

mint calc(string s){
  mint dp[s.size()+1][24][2][2];memset(dp,0,sizeof(dp));//smaller/3
  dp[0][0][0][0]=1;
  rep(i,s.size()){
    ll p=s[i]-'0';
    rep(j,24){
      rep(k,2){
        if(p==3)dp[i+1][(j*10+p)%24][0][1]+=dp[i][j][0][k];
        else dp[i+1][(j*10+p)%24][0][k]+=dp[i][j][0][k];
        rep(l,p){
          if(l==3)dp[i+1][(j*10+l)%24][1][1]+=dp[i][j][0][k];
          else dp[i+1][(j*10+l)%24][1][k]+=dp[i][j][0][k];
        }
        rep(l,10){
          if(l==3)dp[i+1][(j*10+l)%24][1][1]+=dp[i][j][1][k];
          else dp[i+1][(j*10+l)%24][1][k]+=dp[i][j][1][k];
        }
      }
    }
  }
  mint ans=0;
  rep(i,24)rep(j,2)rep(k,2){
    if(i%3==0||k){
      if(i%8==0)continue;
      ans+=dp[s.size()][i][j][k];
    }
  }
  return ans;
}

int main(){
  string a,b;cin >> a >> b;
  mint ans=calc(b)-calc(a);
  ll three=0,eight=0,cnt=0;
  rep(i,a.size()){
    ll p=a[i]-'0';
    if(p==3)cnt++;
    three=(three*10+p)%3;
    eight=(eight*10+p)%8;
  }
  if(three==0||cnt){
    if(eight)ans+=1;
  }
  cout << ans <<endl;
}