#include <bits/stdc++.h>

using namespace std;

const long long MOD = 1e9 + 9;
long long dp[202][2000][2];

vector<long long> solve(string s) {
  memset(dp, 0, sizeof(dp));
  if (s.length() < 201)
    s = string(201 - s.length(), '0') + s;
  
  dp[0][0][0] = 1;
  for (int i = 0; i < 201; i++) {
    for (int j = 0; j < 2000; j++) {
      for (int k = 0; k <= s[i] - '0'; k++) {
        if (j+k < 2000) {
          dp[i+1][j+k][k < s[i] - '0'] += dp[i][j][0];
          dp[i+1][j+k][k < s[i] - '0'] %= MOD;
        }
      }
      for (int k = 0; k < 10; k++) {
        if (j+k < 2000) {
          dp[i+1][j+k][1] += dp[i][j][1];
          dp[i+1][j+k][1] %= MOD;
        }
      }
    }
  }
  
  vector<long long> ret(2000);
  for (int i = 0; i < 2000; i++)
    ret[i] = (dp[201][i][0] + dp[201][i][1]) % MOD;
  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  string m, d;
  cin >> m >> d;

  auto x = solve(m);
  auto y = solve(d);

  long long ret = 0;
  for (int i = 1; i < x.size(); i++) {
    ret += x[i] * y[i] % MOD;
    ret %= MOD;
  }

  cout << ret << endl;
  
  return 0;
}