#include <iostream>
#include <cstdio>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

#define MOD 1000000009
typedef long long LL;

LL dpM[210][2][2000];
LL dpD[210][2][2000];

int main(){
	string m, d;
	cin >> m >> d;
	//dp[桁数][未満確定][合計値]=ケース数
	dpM[0][0][0] = 1;
	dpD[0][0][0] = 1;
	LL ml = m.length();
	LL dl = d.length();
	for (LL i = 0; i < ml; i++){
		LL numM = m[i]-'0';
		for (LL j = 0; j < 2; j++){
			for (LL k = 0; k < 2000; k++){
				for (LL d = 0; d <= (j ? 9 : numM); d++){
					dpM[i + 1][j || d < numM][k + d] = (dpM[i + 1][j || d < numM][k + d] + dpM[i][j][k]) % MOD;
//					cout << i << " " << j << " " << k << " :: ";
//					cout << "dpm[" << i + 1 << "][" << (j || d < num) << "][" << k + d << "] += dpm[" << i << "][" << j << "][" << k << "]" << endl;
				}
			}
		}
	}
	for (LL i = 0; i < dl; i++){
		LL numD = d[i] - '0';
		for (LL j = 0; j < 2; j++){
			for (LL k = 0; k < 2000; k++){
				for (LL d = 0; d <= (j ? 9 : numD); d++){
					dpD[i + 1][j || d < numD][k + d] = (dpD[i + 1][j || d < numD][k + d] + dpD[i][j][k]) % MOD;
				}
			}
		}
	}

	//for (int i = 0; i < 10; i++){
	//	cout << dpM[ml][0][i] + dpM[ml][1][i] << ":::" << dpD[ml][0][i] + dpD[ml][1][i] << endl;
	//}

	LL ans = 0;
	LL Mans[2000] = { 0 };
	LL Dans[2000] = { 0 };
	for (LL i = 1; i < 2000; i++){
		Mans[i] += dpM[ml][0][i] + dpM[ml][1][i];
		Dans[i] += dpD[dl][0][i] + dpD[dl][1][i];
		Mans[i] %= MOD;
		Dans[i] %= MOD;
	}

	for (LL i = 0; i < 2000; i++){
		ans += Mans[i] * Dans[i];
		ans %= MOD;
	}
	cout << ans << endl;
	return 0;
}