#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

const int mod = 1000000009;

i64 dp[222][2222][2];

int f(int x) { return 9*x+1; }

vector<i64> solve(string s) {
  int sz = s.size();
  memset(dp, 0, sizeof(dp));
  dp[0][0][0] = 1;
  for(int i : range(sz)) {
    for(int j : range(f(i))) {
      dp[i][j][0] %= mod;
      dp[i][j][1] %= mod;
      int ith = s[i] - '0';
      for(int k : range(ith)) {
        dp[i+1][j+k][1] += dp[i][j][0];
      }
      dp[i+1][j+ith][0] += dp[i][j][0];
      for(int k : range(10)) {
        dp[i+1][j+k][1] += dp[i][j][1];
      }
    }
  }
  vector<i64> res(f(sz));
  for(int i : range(f(sz))) {
    res[i] = (dp[sz][i][0] + dp[sz][i][1]) % mod;
  }
  return res;
}

int main(void) {
  string s, t; cin >> s >> t;
  vector<i64> a = solve(s);
  vector<i64> b = solve(t);
  i64 res = 0;
  for(int i : range(min(a.size(), b.size()))) {
    res += a[i] * b[i] % mod;
  }
  printf("%d\n", int((res + mod - 1) % mod));
  return 0;
}