#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using mint = atcoder::static_modint<9+(int)1e9>;
using ll = long long;
vector<vector<mint>> solve(const string& S) {
	int N = S.size();
	vector dp(N + 1, vector(2, vector<mint>(200*9+1)));
	dp[0][0][0] = 1;
	for(int i = 0; i < N; i++) {
		for(int less = 0; less < 2; less++) {
			for(int dc = 0; dc < 200*9+1; dc++) {
				int lim = less ? 9 : S[i] - '0';
				for(int d = 0; d <= lim; d++) if(dc+d<200*9+1){
					dp[i + 1][less|(d<S[i]-'0')][dc+d] += dp[i][less][dc];
				}
			}
		}
	}
	return dp[N];
}
int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	string M, D;
	cin >> M >> D;
	auto dp1 = solve(M);
	auto dp2 = solve(D);
	mint ans = 0;
	for(int i=0;i<2;i++)for(int j=0;j<2;j++)for(int x=0;x< 200*9+1;x++) {
		ans+=dp1[i][x]*dp2[j][x];
	}
	ans--;
	cout <<ans.val() << "\n";
}