#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <iterator>
#include <bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)
#define tenll(x) ((ll)1e##x)

// #pragma comment(linker,"/STACK:36777216")

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> void chmax(T& l, const T r) { l = max(l, r); }
template<class T> void chmin(T& l, const T r) { l = min(l, r); }

const int MOD = ten(9) + 9;

vector<ll> digit_dp(const string& s){
	vector<int> a;
	for (auto c : s) a.push_back(c - '0');
	reverse(a.begin(), a.end());

	static ll buf[4][2010];
	memset(buf, 0, sizeof(buf));
	auto pv_leq = buf[0], pv_gt = buf[1], nt_leq = buf[2], nt_gt = buf[3];
	pv_leq[0] = 1;
	FOR(i, sz(a)){
		memset(nt_leq, 0, sizeof(buf[0]));
		memset(nt_gt, 0, sizeof(buf[0]));
		FOR(j, 2010) {
			if (pv_leq[j] == 0 && pv_gt[j] == 0) continue;
			FOR(d, 10) {
				int nj = j + d;
				if (d > a[i]) {
					(nt_gt[nj] += pv_leq[j] + pv_gt[j]) %= MOD;
				} else if (d < a[i]) {
					(nt_leq[nj] += pv_leq[j] + pv_gt[j]) %= MOD;
				} else {
					(nt_leq[nj] += pv_leq[j]) %= MOD;
					(nt_gt[nj] += pv_gt[j]) %= MOD;
				}
			}
		}
		swap(pv_leq, nt_leq);
		swap(pv_gt, nt_gt);
	}
	--pv_leq[0];

	vector<ll> ret;
	FOR(i, 2010) ret.push_back(pv_leq[i]);
	return ret;
}

int main() {
	string m, d; cin >> m >> d;
	auto x = digit_dp(m);
	auto y = digit_dp(d);
	ll ans = 0;
	FOR(i, 2010) ans += x[i] * y[i] % MOD;

	cout << ans % MOD << endl;

	return 0;
}