#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <bitset>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

template<int MOD>
struct ModInt {
	static const int Mod = MOD;
	unsigned x;
	ModInt(): x(0) { }
	ModInt(signed sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	ModInt(signed long long sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	int get() const { return (int)x; }
	
	ModInt &operator+=(ModInt that) { if((x += that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator-=(ModInt that) { if((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
	
	ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
	ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
	ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
};
typedef ModInt<1000000009> mint;

string D, M;

mint memo[202][2][201 * 9 + 1];
mint rec(int i, bool lt, int s) {
	if(s < 0) return mint();
	mint &r = memo[i+1][lt][s];
	if(r.x != -1) return r;
	if(i == -1) return r = s == 0 ? 1 : 0;
	r = 0;
	int d = i < (int)D.size() ? D[D.size() - 1 - i] - '0' : 0;
	rep(e, 10) if(lt || e <= d)
		r += rec(i-1, lt || e < d, s - e);
	return r;
}

int main() {
	cin >> D >> M;
	int len = max(D.size(), M.size()), S = len * 9;
	vector<mint> ds(S + 1);
	mset(memo, -1);
	rer(s, 0, S)
		ds[s] = rec(len-1, false, s) - (s == 0);
	swap(D, M);
	vector<mint> ms(S + 1);
	mset(memo, -1);
	rer(s, 0, S)
		ms[s] = rec(len-1, false, s) - (s == 0);
	mint ans;
	rer(s, 0, S) {
//		cerr << s << ": " << ds[s].get() << " * " << ms[s].get() << endl;
		ans += ds[s] * ms[s];
	}
	cout << ans.get() << endl;
	return 0;
}