#include <cstdio>
#include <vector>
#include <functional>
#include <cstdint>
#include <string>
#include <utility>

using namespace std;

struct DigitDP {
    using Func=function<size_t (size_t, size_t)>;
    vector<Func> funcs;
    vector<size_t> ubs;
    size_t size, n;
    int64_t mod;
    vector<int64_t> dp;
    DigitDP(int64_t mod): size(2), mod(mod) {}
    void add_func(size_t ub, const Func &&func) {
        size *= ub;
        ubs.push_back(ub);
        funcs.push_back(func);
    }
    void store(const string &number) {
        n = number.length();
        dp.assign(size*(n+1), 0); dp[0]=1;
        vector<size_t> indices(funcs.size());

        for (size_t pos=0; pos<n; ++pos)
            for (size_t tight=0; tight<2; ++tight)
                modify_table(number, pos, tight, dp, indices);
    }
    void modify_table(
        const string &number, size_t pos, size_t tight, vector<int64_t> &dp,
        vector<size_t> &indices, size_t depth=0
    ) {
        if (depth == funcs.size()) {
            size_t ub=tight? 9:(number[pos]-'0');
            for (size_t d=0; d<=ub; ++d) {
                size_t next=pos+1, prev=pos;
                (next <<= 1) |= (tight || d < ub);
                (prev <<= 1) |= tight;

                for (size_t i=0; i<indices.size(); ++i) {
                    (next *= ubs[i]) += funcs[i](indices[i], d);
                    (prev *= ubs[i]) += indices[i];
                }

                (dp[next] += dp[prev]) %= mod;
            }
            return;
        }

        for (indices[depth]=0; indices[depth]<ubs[depth]; ++indices[depth])
            modify_table(number, pos, tight, dp, indices, depth+1);
    }
    template <class Satisfies>
    pair<int64_t, int64_t> count_up(Satisfies satisfies) {
        vector<size_t> indices(funcs.size());

        pair<int64_t, int64_t> res;
        count_up(indices, satisfies, res);
        return res;
    }
    template <class Satisfies>
    void count_up(
        vector<size_t> &indices, Satisfies satisfies,
        pair<int64_t, int64_t> &res, size_t depth=0
    ) {
        if (depth == indices.size()) {
            if (!satisfies(indices)) return;

            size_t lt=(n<<1), eq=(n<<1|1);
            for (size_t i=0; i<depth; ++i) {
                (lt *= ubs[i]) += indices[i];
                (eq *= ubs[i]) += indices[i];
            }

            (res.first += dp[eq]) %= mod;
            (res.second += dp[eq] + dp[lt]) %= mod;
            return;
        }

        for (indices[depth]=0; indices[depth]<ubs[depth]; ++indices[depth])
            count_up(indices, satisfies, res, depth+1);
    }
};

int64_t count(const string &A, const string &B, int64_t mod=1e9+7) {
    DigitDP d(mod);

    d.add_func(2, [](size_t k, size_t d)->size_t {
        return k || d == 3;
    });
    d.add_func(3, [](size_t l, size_t d)->size_t {
        return (l + d) % 3;
    });
    d.add_func(8, [](size_t m, size_t d)->size_t {
        return (m * 10 + d) % 8;
    });

    int64_t res=0;
    auto satisfies=[](const vector<size_t> &v)->bool {
        return (v[0] || v[1] == 0) && v[2] != 0;
    };

    d.store(B);
    res += d.count_up(satisfies).second;

    d.store(A);
    res -= d.count_up(satisfies).first;

    return (res += mod) % mod;
}

int main() {
    string A, B; {
        char tmp[16384];
        scanf("%s", tmp);
        A = tmp;
        scanf("%s", tmp);
        B = tmp;
    }

    printf("%lld\n", count(A, B));
    return 0;
}