#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
#define pb push_back
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

const int mod=1000000007;

string S;
int memo[10101][2][3][2][8];

int dfs(int n,int f,int mod3,int ap3,int mod8){
    if(n==S.size())return (!mod3||ap3)&&mod8;
    if(~memo[n][f][mod3][ap3][mod8])
        return memo[n][f][mod3][ap3][mod8];

    int ret=0;

    rep(i,10){
        if(!f&&S[n]-'0'<i)break;
        ret=(ret+dfs(n+1,f|(S[n]-'0'!=i),(mod3*10+i)%3,ap3|(i==3),(mod8*10+i)%8))%mod;
    }

    return memo[n][f][mod3][ap3][mod8]=ret;
}

signed main(){
    string A,B;cin>>A>>B;
    int ans=0;

    S=B;
    memset(memo,-1,sizeof(memo));
    ans=dfs(0,0,0,0,0);
    S=A;S[S.size()-1]--;
    for(int i=S.size()-1;i>=0;i--){
        int d=S[i]-'0';
        if(d>=0)break;
        S[i]+=10;
        S[i-1]--;
    }
    memset(memo,-1,sizeof(memo));
    ans=(ans-dfs(0,0,0,0,0)+mod)%mod;

    cout<<ans<<endl;
    return 0;
}