#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

string M,D;
ll mo=1000000009;
map<int,ll> MM,DD;
ll dp[205][2050];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	dp[0][0]=1;
	FOR(i,202) {
		for(y=2000;y>=0;y--) {
			for(x=9;x>=0;x--) (dp[i+1][y+x]+=dp[i][y])%=mo;
		}
	}
	
	cin>>M>>D;
	
	reverse(M.begin(),M.end());
	reverse(D.begin(),D.end());
	int tot=0;
	while(D.size()) {
		int x=D[D.size()-1]-'0';
		FOR(i,x) FOR(y,2020) if(dp[D.size()-1][y]) (DD[y+tot+i] += dp[D.size()-1][y])%=mo;
		tot+=x;
		D.pop_back();
	}
	DD[tot]++;
	
	tot=0;
	while(M.size()) {
		int x=M[M.size()-1]-'0';
		FOR(i,x) FOR(y,2020) if(dp[M.size()-1][y]) (MM[y+tot+i] += dp[M.size()-1][y])%=mo;
		tot+=x;
		M.pop_back();
	}
	MM[tot]++;
	
	ll ret=0;
	ITR(it,MM) if(it->first) ret += it->second*DD[it->first]%mo;
	cout<<ret%mo<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}