#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const ll mod = (ll)1e9 + 7LL;

ll dp[10005][2][2][3][8]; 	// dp[i桁目][N未満であることが確定しているか 0 -> していない 1 -> している][3 の付く数字か 0 -> そうでない 1 -> そう][mod 3 の値][mod 8 の値]

ll solve (string s){
	memset (dp, 0LL, sizeof(dp));

	int n = s.length();
	dp[0][0][0][0][0] = 1LL;
	for (int i = 0; i < n; ++i){
		int D = (int)(s[i] - '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){
						for (int d = 0; d < (j ? 10 : D + 1); ++d){
							(dp[i + 1][j || d < D][k || d == 3][(10 * l + d) % 3][(10 * m + d) % 8] += dp[i][j][k][l][m]) % mod;
						} // end for
					} // end for
				} // end for
			} // end for
		} // end for
	} // end for

	ll res = 0LL;
	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 == 1 || l == 0) && (m != 0)) (res += dp[n][j][k][l][m]) % mod;
				} // end for
			} // end for
		} // end for
	} // end for

	return res;
}

string minus_one(string s){
	reverse(ALL(s));

	for (int i = 0; i < s.length(); ++i){
		if (s[i] != '0'){
			s[i] = (char)((int)(s[0] - '0') - 1 + '0');
			break;
		}else{
			s[i] = '9';
		} // end if
	} // end for

	while (s.length() > 1 && s[s.length() - 1] == '0') s = s.substr(0, s.length() - 1);

	reverse(ALL(s));

	return s; 
}

int main(){
	string A, B; cin >> A >> B;
	A = minus_one(A);
	ll res = (solve(B) - solve(A) + mod) % mod;
	cout << res << endl;
	
	return 0;
}