#include using namespace std; typedef long long ll; const ll MOD = 1000000009; int main() { string M, D; cin >> M >> D; int M_sz = M.size(); int D_sz = D.size(); vector>>dp1(250, vector>(2, vector(2000, 0))); vector>>dp2(250, vector>(2, vector(2000, 0))); dp1[0][0][0] = 1; dp2[0][0][0] = 1; for (int i = 0; i < M_sz; i++) { int mi = M[i] - '0'; for (int j = 0; j < 2; j++) { for (int k = 0; k < 2000; k++) { for (int d = 0; d <= (j ? 9 : mi); d++) { dp1[i+1][j || (d < mi)][k+d] += dp1[i][j][k]%MOD; } } } } for (int i = 0; i < D_sz; i++) { int di = D[i] - '0'; for (int j = 0; j < 2; j++) { for (int k = 0; k < 2000; k++) { for (int d = 0; d <= (j ? 9 : di); d++) { dp2[i+1][j || (d < di)][k+d] += dp2[i][j][k]%MOD; } } } } ll ans = 0; ll tmp1, tmp2; for (int i = 1; i < 2000; i++) { tmp1 = dp1[M_sz][0][i]%MOD + dp1[M_sz][1][i]%MOD; tmp2 = dp2[D_sz][0][i]%MOD + dp2[D_sz][1][i]%MOD; ans += ((tmp1%MOD) * (tmp2%MOD))%MOD; ans %= MOD; } cout << ans << endl; return 0; }