#include <bits/stdc++.h>
using namespace std;
const int MAXP = 1e4 + 4;
const int MOD = 1e9 + 7;
#define rep( i, a ) for(int i = 0; i < (a); ++i)

string a, b;
int n, m;

int way[MAXP][2][2][3][8];

int dp(const string &s, int n){
    memset( way, 0, sizeof(way) );
    way[0][0][0][0][0] = 1;
    rep( i, n ) rep( j, 2 ) rep( k, 2 ) rep( l, 3 ) rep( m, 8 ){
        int lim = j ? 9 : s[i] - '0';
        rep( d, lim + 1 )
            ( way[i + 1][j || d < lim][k || d == 3][ ( l + d ) % 3 ][ ( m * 10 + d ) % 8 ]
            += way[i][j][k][l][m] ) %= MOD;
    }
    int res = 0;
    rep( j, 2 ) rep( k, 2 ) rep( l, 3 ) rep( m, 8 )
        if( ( k || l == 0 ) && m != 0 )
            ( res += way[n][j][k][l][m] ) %= MOD;
    return res;
}

int match(const string &s, int n){
    int sum = 0, has3 = 0;
    for(int i = 0; i < n; ++i){
        sum += s[i] - '0';
        if( s[i] == '3' ) has3 = 1;
    }
    if( sum % 3 != 0 && has3 == 0 ) return 0;
    int k = 0;
    for(int i = n - 3; i < n; ++i){
        if( i < 0 ) continue;
        k = k * 10 + s[i] - '0';
    }
    return k % 8 != 0;
}

void solve(){
    int cnt_a = dp( a, n );
    int cnt_b = dp( b, m );
    int ans = cnt_b - cnt_a + match( a, n );
    cout << ( ans + MOD ) % MOD << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin >> a >> b;
    n = a.size(), m = b.size();
    solve();
    return 0;
}