#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a; i<n; i++)
using namespace std;
typedef long long int ll;
constexpr ll MOD = 1000000009;

// digit, sum, flag
ll dp[210][2000][2];

vector<ll> solve(string s) {
	int N = s.length();
	memset(dp, 0, sizeof(dp));
	dp[0][0][0] = 1;

	rep(i,0,N) rep(j,0,2000) rep(f,0,2) {
		if(dp[i][j][f] == 0) continue;
		int lim = f ? 9 : s[i] - '0';
		rep(x,0,lim+1) {
			(dp[i+1][j+x][f || x < lim] += dp[i][j][f]) %= MOD;
		}
	}
	vector<ll> ret;
	rep(i,0,2000) {
		ll val = (dp[N][i][0] + dp[N][i][1]) % MOD;
		ret.push_back(val);
	}
	return ret;
}

int main() {
	string M, D; cin >> M >> D;
	vector<ll> vl = solve(M), vr = solve(D);
	int S = vl.size();
	ll ans = 0;
	rep(i,1,S) {
		(ans += vl[i] * vr[i]) %= MOD;
	}
	cout << ans << endl;
	return 0;
}