#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
using ll = long long;
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }
ll gcd(ll a, ll b) { while (a) { b %= a; swap(a, b); } return b; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
// strmodin(s, a, b, m)[i][j] = the number of digits t in mod m  for  t \le s, i = t \bmod \prod a and t contains digits j \subset b
vector<vector<ll> > strmodin(string const & s, vector<int> const & a, vector<int> const & b, ll m) {
    int al = whole(accumulate, a, 1ll, lcm);
    int bl = 1ll << b.size();
    auto cur = vectors(2, bl, al, ll());
    auto prv = vectors(2, bl, al, ll());
    cur[0][0][0] = 1;
    for (char c : s) {
        cur.swap(prv);
        repeat (p,2) repeat (j,bl) repeat (i,al) {
            repeat (d,10) {
                bool np;
                if (d < (c-'0') or p) np = true;
                else if (d == (c-'0')) np = false;
                else continue;
                int nj = j; {
                    auto it = whole(find, b, d);
                    if (it != b.end()) nj |= 1 << (it - b.begin());
                }
                int ni = (i * 10 + d) % al;
                ll & it = cur[np][nj][ni];
                it = (it + prv[p][j][i]) % m;
            }
            prv[p][j][i] = 0;
        }
    }
    auto result = vectors(al, bl, ll());
    repeat (p,2) repeat (j,bl) repeat (i,al) {
        result[i][j] += cur[p][j][i];
        result[i][j] %= m;
    }
    return result;
}
const int mod = 1e9+7;
ll f(string const & s) {
    auto dp = strmodin(s, { 3, 8 }, { 3 }, mod);
    ll cnt = 0;
    repeat (i,3*8) repeat (j,2) {
        if ((i % 3 == 0 or j) and i % 8 != 0) {
            cnt += dp[i][j];
            cnt %= mod;
        }
    }
    return cnt;
}
bool g(string const & s) {
    auto modstr = [&](ll m) {
        ll q = 0;
        for (char c : s) q = (q * 10 + (c - '0')) % m;
        return q;
    };
    return (modstr(3) == 0 or whole(count, s, '3')) and modstr(8) != 0;
}
int main() {
    string a, b; cin >> a >> b;
    cout << ((f(b) - f(a) + g(a)) % mod + mod) % mod << endl;
    return 0;
}