#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
using mint=modint1000000007;
void SOLVE(){
  string a,b;
  cin>>a>>b;
  {
    if(a=="1")a="0";
    else{
      int idx=a.size()-1;
      while(true){
        if(a[idx]!='0'){
          a[idx]--;
          break;
        }
        a[idx--]='9';
      }
    }
  }
  auto solve=[](string s)->mint {
    int n=s.size();
    auto dp=vec<mint>({n+1,2,3,8,2},0);
    dp[0][0][0][0][0]=1;
    rep(i,n){
      rep(j,2){
        rep(k,3){
          rep(l,8){
            rep(m,2){
              rep(o,j?10:s[i]-'0'+1){
                dp[i+1][j||o<s[i]-'0'][(k*10+o)%3][(l*10+o)%8][m||o==3]+=dp[i][j][k][l][m];
              }
            }
          }
        }
      }
    }
    mint ret=0;
    rep(i,2){
      reps(j,1,8){
        rep(k,3)rep(l,2)if(k%3==0||l)ret+=dp[n][i][k][j][l];
      }
    }
    return ret;
  };
  cout<<(solve(b)-solve(a)).val()<<endl;
}