#include <iostream>
#include <string.h>
using namespace std;
typedef long long ll;

const ll MOD = 1e9 + 7;

ll dp[10010][2][24][2];
ll func(const string&S, bool last, int k, bool less, int mod, bool used3) {
    if(k >= S.size()) {
        if(!less && !last)return 0;
        bool aho = (mod % 3 == 0) || used3;
        bool sei = (mod % 8 == 0);
        return aho && !sei;
    }
    if(dp[k][less][mod][used3] != -1)return dp[k][less][mod][used3];

    ll res = 0;
    int d = S[k] - '0';
    for(int i=0;i<10;i++) {
        if(i <= d || less) {
            res += func(S, last, k + 1, less || (i < d), (mod * 10 + i) % 24, used3 || (i == 3));
        }
    }

    res %= MOD;
    return dp[k][less][mod][used3] = res;
}

ll solve(const string& S, bool last) {
    memset(dp, -1, sizeof(dp));
    return func(S, last, 0, false, 0, false);
}

int main(){
    string A, B;
    cin >> A >> B;

    ll res = solve(B, true) - solve(A, false);
    res = (res + MOD) % MOD;

    cout << res << endl;
    return 0;
}