#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())


#define MOD 1000000009


int dp1[202][2][2000];
int dp2[202][2][2000];

string m,d;

void f(int dp[202][2][2000],string &n){
	dp[0][0][0]=1;
	rep(i,n.size())rep(j,2)rep(k,2000)if(dp[i][j][k]){
		int v=dp[i][j][k];
		int md=(j==0?n[i]-'0':9)+1;
		rep(d,md){
			(dp[i+1][j||d<n[i]-'0'][k+d]+=v)%=MOD;
		}
	}
}


int main(){
	cin>>m>>d;
	f(dp1,m);
	f(dp2,d);
	long long ans=0;
	for(int i=1;i<2000;i++){
		ans+=(long long)dp1[m.size()][0][i]*dp2[d.size()][0][i]%MOD;
		ans+=(long long)dp1[m.size()][0][i]*dp2[d.size()][1][i]%MOD;
		ans+=(long long)dp1[m.size()][1][i]*dp2[d.size()][0][i]%MOD;
		ans+=(long long)dp1[m.size()][1][i]*dp2[d.size()][1][i]%MOD;
		ans%=MOD;
	}
	cout<<ans<<endl;
	return 0;
}