#include <bits/stdc++.h>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;



ll dpm[210][2][2010];
ll dpd[210][2][2010];

const ll mod=1000000009;

int main(void){
	string m,d;
	cin >> m >> d;
	int nm=m.size();
	dpm[0][0][0]=1LL;
	rep(i,nm)rep(lt,2)rep(sum,2010){
		rep(digit,10){
			int cur=m[i]-'0';
			int nlt=lt;
			if(nlt==0&&digit>cur) break;
			if(nlt==0&&digit<cur) nlt=1;
			int nsum=sum+digit;
			dpm[i+1][nlt][nsum]+=dpm[i][lt][sum];
			dpm[i+1][nlt][nsum]%=mod;
		}
	}
	int nd=d.size();
	dpd[0][0][0]=1LL;
	rep(i,nd)rep(lt,2)rep(sum,2010){
		rep(digit,10){
			int cur=d[i]-'0';
			int nlt=lt;
			if(nlt==0&&digit>cur) break;
			if(nlt==0&&digit<cur) nlt=1;
			int nsum=sum+digit;
			dpd[i+1][nlt][nsum]+=dpd[i][lt][sum];
			dpd[i+1][nlt][nsum]%=mod;
		}
	}
	ll ans=0LL;
	range(i,1,2010){
		ll curm=(dpm[nm][0][i]+dpm[nm][1][i])%mod;
		ll curd=(dpd[nd][0][i]+dpd[nd][1][i])%mod;
		ans+=(curm*curd)%mod;
		ans%=mod;
	}
	cout << ans << endl;
	return 0;
}