#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a; i<n; i++)
#define repq(i,a,n) for(int i=a; i<=n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
typedef long long int ll;
typedef pair<int, int> pii;
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
constexpr ll MOD = 1000000007LL;

// digit, mod3, has3, mod8, flag
ll dp[10010][3][2][8][2];

ll solve(string s, int less) {
    memset(dp, 0, sizeof(dp));
    dp[0][0][0][0][0] = 1;

    int N = s.length();
    rep(i,0,N) rep(j,0,3) rep(k,0,2) rep(l,0,8) rep(f,0,2) {
        int lim = f ? 9 : s[i] - '0';
        rep(x,0,lim + 1) {
            int mo3 = (j * 10 + x) % 3;
            int mo8 = (l * 10 + x) % 8;
            (dp[i+1][mo3][k || x == 3][mo8][f || x < lim] += dp[i][j][k][l][f]) %= MOD;
        }
    }

    ll ret = 0;
    rep(j,0,3) rep(k,0,2) rep(l,0,8) rep(f,0,2) {
        if(less == 1 && f == 0) continue;
        if((j == 0 || k == 1) && l != 0) (ret += dp[N][j][k][l][f]) %= MOD;
    }
    return ret;
}

int main() {
    string A, B; cin >> A >> B;

    ll ra = solve(A, 1), rb = solve(B, 0);
    cout << (rb - ra + MOD) % MOD << endl;
    return 0;
}