#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include <iomanip>
#include <math.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000009 // 10^9 + 9
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60
const double PI = 3.14159265358979323846;

ll A[209], B[209];

ll dp1[209][2][1809];
ll dp2[209][2][1809];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	string S, T; cin >> S >> T;
	for (int i = 0; i < S.size(); i++) A[i] = S[i] - '0';
	for (int i = 0; i < T.size(); i++) B[i] = T[i] - '0';

	dp1[0][0][0] = dp2[0][0][0] = 1LL;
	for (int i = 0; i < S.size(); i++) {
		for (int j = 0; j < 2; j++) {
			for (int k = 0; k <= 1800; k++) {
				for (int l = 0; l <= (j ? 9 : A[i]); l++) {
					if (k + l <= 1800) {
						dp1[i + 1][j || (l < A[i])][k + l] += dp1[i][j][k];
						dp1[i + 1][j || (l < A[i])][k + l] %= MOD;
					}
				}
			}
		}
	}

	for (int i = 0; i < T.size(); i++) {
		for (int j = 0; j < 2; j++) {
			for (int k = 0; k <= 1800; k++) {
				for (int l = 0; l <= (j ? 9 : B[i]); l++) {
					if (k + l <= 1800) {
						dp2[i + 1][j || (l < B[i])][k + l] += dp2[i][j][k];
						dp2[i + 1][j || (l < B[i])][k + l] %= MOD;
					}
				}
			}
		}
	}

	ll ans = 0;
	for (int i = 1; i <= 1800; i++) {
		ans += ((dp1[S.size()][0][i] + dp1[S.size()][1][i]) % MOD) * ((dp2[T.size()][0][i] + dp2[T.size()][1][i]) % MOD);
		ans %= MOD;
	}
	cout << ans << endl;

	return 0;
}