#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "util.h"

using namespace std;

//呪文
#define DUMPOUT cout
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll;
template<typename _Ty> using Mat = vector<vector<_Ty>>;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; } cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) {	if (s.empty()) { cout << "{ }"; return ostr; } stack<_Ty> t(s); cout << "{" << t.top(); t.pop(); while (!t.empty()) { cout << ", " << t.top(); t.pop(); } cout << "}";	return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { cin >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) cin >> v[i]; return istr; }
ll modpow(ll n, ll p, ll m) { ll result = 1; while (p > 0) { if (p & 1) result = (result * n) % m; p >>= 1; n = (n * n) % m; } return result; }
template <typename _Ty> _Ty ipow(_Ty x, _Ty n) { _Ty ret = _Ty(1); for (_Ty i = _Ty(0); i < n; i++) ret *= x; return ret; }
template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-8
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define fake false



const ll MOD = 1000000009;
ll dp[210][2][2000]; // digit, less, sum
vector<ll> dsM, dsD;


vector<ll> count(string A) {
	Fill(dp, 0);
	int n = A.size();

	dp[0][0][0] = 1;
	REP(i, n) REP(j, 2) REP(k, 1900) {
		int lim = j ? 9 : A[i] - '0';
		REP(d, lim + 1) {
			(dp[i + 1][j || d < lim][k + d] += dp[i][j][k]) %= MOD;
		}
	}

	vector<ll> res;
	REP(k, 1900) {
		res.push_back(dp[n][0][k] + dp[n][1][k]);
	}
	return res;
}


int main()
{
	//clock_t start, end;
	//start = clock();

	string M, D;
	cin >> M >> D;

	vector<ll> dsM, dsD;
	dsM = count(M); 
	dsD = count(D);
	
	ll ans = 0;
	for (ll k = 1; k < 1900; k++) {
		(ans += dsM[k] * dsD[k] % MOD) %= MOD;
	}
	cout << ans << endl;
	
	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}