#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
template<class T> inline bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }
typedef long long ll;
using namespace std;

const ll mod = 1000000007;
ll dp[10101][2][2][3][2][8];


int main(){
    string A, B; cin >> A >> B;
    int N = B.size();
    int dif = B.size() - A.size();

    dp[0][0][0][0][0][0] = 1;
    rep(i, N){
        int na, nb;
        nb = B[i] - '0';
        if (i < dif) na = 0;
        else na = A[i-dif] - '0';
        rep(ja, 2) rep(jb, 2) rep(k, 3) rep(l, 2) rep(m, 8) rep(d, 10) {
            int ni, nja, njb, nk, nl, nm;
            ni = i + 1;
            nja = ja;
            njb = jb;
            nk = (k + d)%3;
            nl = l;
            nm = (10*m + d)%8;
            if (nja==0){
                if (d > na) nja = 1;
                if (d < na) continue;
            }
            if (njb==0){
                if (d < nb) njb = 1;
                if (d > nb) continue;
            }
            if (d==3) nl = 1;
            dp[ni][nja][njb][nk][nl][nm] += dp[i][ja][jb][k][l][m];
            dp[ni][nja][njb][nk][nl][nm] %= mod;
        }
    }
    ll ans = 0;
    rep(ja, 2) rep(jb, 2) rep(k, 3) rep(l, 2) rep(m, 8) {
        if (k==0 || l==1){
            if (m == 0) continue;
            ans += dp[N][ja][jb][k][l][m];
            ans %= mod;
        }
    }
    cout << ans << endl;
    return 0;
}