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

template<const unsigned int MOD> struct prime_modint {
    using mint = prime_modint;
    unsigned int v;
    prime_modint() : v(0) {}
    prime_modint(unsigned int a) { a %= MOD; v = a; }
    prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    static constexpr int mod() { return MOD; }
    mint& operator++() {v++; if(v == MOD)v = 0; return *this;}
    mint& operator--() {if(v == 0)v = MOD; v--; return *this;}
    mint operator++(int) { mint result = *this; ++*this; return result; }
    mint operator--(int) { mint result = *this; --*this; return result; }
    mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }
    mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }
    mint& operator*=(const mint& rhs) {
        v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);
        return *this;
    }
    mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }
    mint pow(long long n) const {
        assert(0 <= n);
        mint r = 1, x = *this;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    mint inv() const { assert(v); return pow(MOD - 2); }
    friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }
    friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }
    friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }
};
using mint = prime_modint<1000000007>;
//using mint = prime_modint<998244353>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    string A, B;
    cin >> A >> B;
    reverse(A.begin(), A.end());
    A[0]--;
    for(int i = 0; i < A.size() && A[i] < '0'; i++){
        A[i] += 10;
        A[i + 1]--;
    }
    if(A.back() == '0')A.pop_back();
    reverse(A.begin(), A.end());
    auto f = [&](string &s){
        int n = s.size();
        vector<array<array<array<mint, 8>, 3>, 4>> dp(n + 1);
        dp[0][2][0][0] = 1;
        for(int i = 0; i < n; i++){
            for(int j = 0; j < 4; j++){
                int r = j >> 1 ? s[i] - '0' : 9;
                for(int k = 0; k < 3; k++){
                    for(int l = 0; l < 8; l++){
                        for(int m = 0; m <= r; m++){
                            dp[i + 1][(j & (2 * (m == r) + 1)) | (m == 3)]
                                [(k + m) % 3][(l * 2 + m) & 7] += dp[i][j][k][l];
                        }
                    }
                }
            }
        }
        mint ans;
        for(int i = 1; i < 8; i++){
            for(int j = 0; j < 3; j++){
                ans += dp[n][0b01][j][i];
                ans += dp[n][0b11][j][i];
            }
            ans += dp[n][0b00][0][i];
            ans += dp[n][0b10][0][i];
        }
        return ans;
    };
    cout << f(B) - f(A) << '\n';
}