#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long int lli;
lli MOD = 1000000007;
lli f(string s)
{
    int n = s.size();
    lli dp[10040][2][3][2][8] = {};  //pos,less,mod,has3,mod8
    dp[0][0][0][0][0] = 1;
    rep(i, n) rep(j, 2) rep(k, 3) rep(l, 2) rep(q, 8)
    {
        int lim = j ? 9 : s[i] - '0';
        rep(m, lim + 1)
        {
            dp[i + 1][j || m < lim][(k + m) % 3][l || m == 3][(10 * q + m) % 8] += dp[i][j][k][l][q];
            dp[i + 1][j || m < lim][(k + m) % 3][l || m == 3][(10 * q + m) % 8] %= MOD;
        }
    }
    lli a = 0;
    rep(j, 2)
    {
        rep(l, 2)
        {
            rep(k, 3)
            {
                rep(q, 8)
                {
                    if ((l || k == 0) && q != 0) {
                        a += dp[n][j][k][l][q];
                        a %= MOD;
                    }
                }
            }
        }
    }
    return a;
}
int main()
{
    string s, t;
    cin >> s;
    lli A = f(s);
    cin >> t;
    lli B = f(t);
    int sum = 0;
    bool flag = false;
    rep(i, s.size())
    {
        sum += s[i] - '0';
        if (s[i] == '3') {
            flag = true;
        }
    }
    if (sum % 3 == 0) {
        flag = true;
    }
    bool ok = false;
    if (s.size() >= 3) {
        int k = s.size();
        int j = 100 * (s[k - 3] - '0');
        j += 10 * (s[k - 2] - '0');
        j += (s[k - 1] - '0');
        if (j % 8 != 0) {
            ok = true;
        }
    } else {
        int k = s.size();
        int j = 10 * (s[k - 2] - '0');
        j += (s[k - 1] - '0');
        if (k % 8 != 0)
            ok = true;
    }
    if (flag && ok) {
        A--;
    }
    cout << (B - A + MOD) % MOD << endl;
}