#include <bits/stdc++.h>

#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using ld = long double;
template <typename T>
vector<T> Vec(int n, T v)
{
    return vector<T>(n, v);
}
template <class... Args>
auto Vec(int n, Args... args)
{
    auto val = Vec(args...);
    return vector<decltype(val)>(n, move(val));
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

constexpr ll MOD = (ll)1e9 + 7LL;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    string A, B;
    cin >> A >> B;
    int N = B.size();
    auto dp = Vec(N + 1, 2, 2, 3, 8, 0LL);  //digit, upper, used '3', mod3, mod8
    auto ope = [&](const string& s) {
        dp[0][1][0][0][0] = 1;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < 2; j++) {
                for (int k = 0; k < 2; k++) {
                    for (int l = 0; l < 3; l++) {
                        for (int m = 0; m < 8; m++) {
                            for (int n = 0; n < 10; n++) {
                                const int mod3 = (l + n) % 3;
                                const int mod8 = (2 * m + n) % 8;
                                const int has3 = ((k == 1 or n == 3) ? 1 : 0);
                                const int upper = ((j == 0 or n != s[i] - '0') ? 0 : 1);
                                if (j == 1 and n > s[i] - '0') {
                                    break;
                                }
                                dp[i + 1][upper][has3][mod3][mod8] += dp[i][j][k][l][m];
                                dp[i + 1][upper][has3][mod3][mod8] %= MOD;
                            }
                        }
                    }
                }
            }
        }
    };
    ope(B);

    ll ans = 0;
    for (int j = 0; j < 2; j++) {
        for (int k = 0; k < 2; k++) {
            for (int l = 0; l < 3; l++) {
                for (int m = 1; m < 8; m++) {
                    if (k == 1 or l == 0) {
                        ans += dp[N][j][k][l][m];
                        ans %= MOD;
                    }
                }
            }
        }
    }

    dp.clear();
    N = A.size();
    dp = Vec(N + 1, 2, 2, 3, 8, 0LL);  //digit, upper, used '3', mod3, mod8
    ope(A);
    for (int j = 0; j < 2; j++) {
        for (int k = 0; k < 2; k++) {
            for (int l = 0; l < 3; l++) {
                for (int m = 1; m < 8; m++) {
                    if (k == 1 or l == 0) {
                        ans += (MOD - dp[N][j][k][l][m]);
                        ans %= MOD;
                    }
                }
            }
        }
    }

    auto aho = [&]() {
        ll sum = 0;
        for (const char c : A) {
            if (c == '3') {
                return true;
            }
            sum += (c - '0');
        }
        return sum % 3 == 0;
    };
    auto seishun = [&]() {
        const ll n = stoll(A.substr(A.size() - 3, 3));
        return n % 8 == 0;
    };
    if (aho() and not seishun()) {
        ans = (ans + 1) % MOD;
    }

    cout << ans << endl;

    return 0;
}