#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;

mint f(string A, bool tf){
    vector<vector<mint>> dp(24, vector<mint>(2, 0));
    int n = A.size();
    vector<int> S(n);
    for(int i = 0; i < n; i++) S[i] = A[i] - '0';
    for(int s = 1; s < S[0]; s++){
        if(s == 3) dp[s][1] = 1;
        else dp[s][0] = 1;
    }

    int eqi = S[0];
    int eqj = 0;
    if(S[0] == 3) eqj = 1;

    for(int i = 1; i < n; i++){
        int s = S[i];
        vector<vector<mint>> ndp(24, vector<mint>(2, 0));
        for(int x = 0; x < 10; x++){
            for(int i = 0; i < 24; i++){
                int ni = (i * 10 + x) % 24;
                for(int j = 0; j < 2; j++){
                    int nj = j;
                    if(x == 3) nj = 1;
                    ndp[ni][nj] += dp[i][j];
                }
            }
        }

        for(int i = 1; i < 10; i++){
            if(i == 3) ndp[i][1]++;
            else ndp[i][0]++;
        }

        for(int i = 0; i < s; i++){
            int ni = (eqi * 10 + i) % 24;
            int nj = eqj;
            if(i == 3) nj = 1;
            ndp[ni][nj]++;
        }
        eqi *= 10;
        eqi += s;
        eqi %= 24;
        if(s == 3) eqj = 1;
        swap(dp, ndp);
    }
    if(tf) dp[eqi][eqj]++;
    mint ret = 0;
    for(int i = 0; i < 24; i++){
        if(i % 8 == 0) continue;
        ret += dp[i][1];
        if(i % 3 == 0) ret += dp[i][0];
    }
    return ret;
    
}

void solve(){
    string A, B;
    cin >> A >> B;
    mint ans = f(B, true) - f(A, false);
    cout << ans.val() << "\n";
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int t;
    t = 1;
    // cin >> t;
    while(t--) solve();
}