#include <iostream>
#include <string>
constexpr long long int mod = 1000000007;

using namespace std;

string A,B;
long long int dp1[100001][2][2][3][8],dp2[100001][2][2][3][8];

int main() {
    cin >> A>>B;
    int n = A.size(),p=B.size();
    dp1[0][0][0][0][0] = 1;
    dp2[0][0][0][0][0] = 1;
    int tmp = n - 1;
    while(A[tmp]=='0'){
        A[tmp] = '9';
        tmp--;
    }
    A[tmp]--;
    if(A[0]=='0'){
        A = A.substr(1);
        n--;
    }
    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++) {
                        int x = j ? 9 : A[i] - '0';
                        for (int d = 0; d <= x; d++) {
                            dp1[i + 1][j || d < x][k || d == 3][(l + d) % 3][(m * 10 + d) % 8] += dp1[i][j][k][l][m];
                        }
                    }
                }
            }
        }
    }
    for (int i = 0; i < p; 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++) {
                        int x = j ? 9 : B[i] - '0';
                        for (int d = 0; d <= x; d++) {
                            dp2[i + 1][j || d < x][k || d == 3][(l + d) % 3][(m * 10 + d) % 8] += dp2[i][j][k][l][m];
                        }
                    }
                }
            }
        }
    }
    long long int 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 = 0; m < 8; m++) {
                    if ((k || l == 0) && m != 0) {
                        ans -= dp1[n][j][k][l][m]-dp2[p][j][k][l][m];
                        ans %= mod;
                    }
                }
            }
        }
    }
    cout << ans << endl;
}