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

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

const int mod=1000000009;

string m,d;
int dp[202][1900][2];

int a[1900]={0}, b[1900]={0};

int main()
{
    cin >>m >>d;
    int M=m.size(), D=d.size();

    // about m
    memset(dp,0,sizeof(dp));
    dp[0][0][0]=1;
    rep(i,M)
    {
        rep(j,1900)
        {
            for(int k=0; k<m[i]-'0'; ++k)
            {
                if(j+k<1900) (dp[i+1][j+k][1]+=dp[i][j][0])%=mod;
            }
            if(j+(m[i]-'0')<1900) (dp[i+1][j+(m[i]-'0')][0]+=dp[i][j][0])%=mod;

            rep(k,10)
            {
                if(j+k<1900) (dp[i+1][j+k][1]+=dp[i][j][1])%=mod;
            }
        }
    }
    rep(i,1900) a[i]=(dp[M][i][0]+dp[M][i][1])%mod;

    // about d
    memset(dp,0,sizeof(dp));
    dp[0][0][0]=1;
    rep(i,D)
    {
        rep(j,1900)
        {
            for(int k=0; k<d[i]-'0'; ++k)
            {
                if(j+k<1900) (dp[i+1][j+k][1]+=dp[i][j][0])%=mod;
            }
            if(j+(d[i]-'0')<1900) (dp[i+1][j+(d[i]-'0')][0]+=dp[i][j][0])%=mod;

            rep(k,10)
            {
                if(j+k<1900) (dp[i+1][j+k][1]+=dp[i][j][1])%=mod;
            }
        }
    }
    rep(i,1900) b[i]=(dp[D][i][0]+dp[D][i][1])%mod;

    ll ans=0;
    for(int i=1; i<1900; ++i) (ans+=(ll)a[i]*b[i])%=mod;
    cout << ans << endl;
    return 0;
}