//https://ncode.syosetu.com/n4830bu/260/
#include <bits/stdc++.h>
using namespace std;

#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;

#include "atcoder/all"
using namespace atcoder;

using Mint = modint1000000007;

Mint maine(string S) {
    vector bef(2, vector(3, vector(2, vector<Mint>(8))));
    vector<int> tens{1};
    int N = (int)S.size();
    for (int i = 0; i < N - 1; i++) {
        tens.emplace_back((tens[i] * 10) % 8);
    }
    reverse(tens.begin(), tens.end());
    bef[1][0][0][0] = 1;
    for (int i = 0; i < N; i++) {
        char c = S[i];
        int n = (int)(c - '0');
        vector now(2, vector(3, vector(2, vector<Mint>(8))));
        for (int flag = 0; flag < 2; flag++) {
            for (int mod3 = 0; mod3 < 3; mod3++) {
                for (int has3 = 0; has3 < 2; has3++) {
                    for (int mod8 = 0; mod8 < 8; mod8++) {
                        for (int num = 0; num <= (flag ? n : 9); num++) {
                            now[flag && (num == n)][(mod3 + num) % 3][has3 | (num == 3)][(mod8 + num * tens[i]) % 8] += bef[flag][mod3][has3][mod8];
                        }
                    }
                }
            }
        }
        swap(bef, now);
    }
    Mint ret = 0;
    for (int flag = 0; flag < 2; flag++) {
        for (int mod3 = 0; mod3 < 3; mod3++) {
            for (int has3 = 0; has3 < 2; has3++) {
                for (int mod8 = 0; mod8 < 8; mod8++) {
                    ret += bef[flag][mod3][has3][mod8] * ((mod3 == 0) | has3) * (!!mod8);
                }
            }
        }
    }
    return ret;
}

int main() {
    string A, B;
    cin >> A >> B;
    cpp_int A_num(A);
    A_num--;
    A = A_num.str();
    cout << (maine(B) - maine(A)).val() << endl;
}