import java.io.*;
import java.util.*;

public class Main {
    static final int MOD = 1000000009;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        long[] month = getDp(sc.next().toCharArray());
        long[] day = getDp(sc.next().toCharArray());
        long ans = 0;
        for (int i = 1; i < month.length && i < day.length; i++) {
            ans += (month[i] % MOD) * (day[i] % MOD) % MOD;
            ans %= MOD;
        }
        System.out.println(ans);
    }
    
    static long[] getDp(char[] inputA) {
        long[][] dp = new long[inputA.length][inputA.length * 9 + 1];
        for (int i = 1; i < inputA[0] - '0'; i++) {
            dp[0][i] = 1;
        }
        int current = inputA[0] - '0';
        for (int i = 1; i < inputA.length; i++) {
            int x = inputA[i] - '0';
            for (int j = 1; j < i * 9; j++) {
                if (dp[i - 1][j] == 0) {
                    continue;
                }
                for (int k = 0; k < 10; k++) {
                    dp[i][j + k] += dp[i - 1][j];
                    dp[i][j + k] %= MOD;
                }
            }
            for (int j = 1; j < 10; j++) {
                dp[i][j]++;
            }
            for (int j = 0; j < x; j++) {
                dp[i][current + j]++;
            }
            current += x;
        }
        dp[inputA.length - 1][current]++;
        return dp[inputA.length - 1];
    }
    
    static HashMap<Integer, Integer> getMap(int x) {
        HashMap<Integer, Integer> ans = new HashMap<>();
        for (int i = 2; i <= x; i++) {
            int y = i;
            for (int j = 2; j <= Math.sqrt(y); j++) {
                while (y % j == 0) {
                    ans.put(j, ans.getOrDefault(j, 0) + 1);
                    y /= j;
                }
            }
            if (y > 1) {
                ans.put(y, ans.getOrDefault(y, 0) + 1);
            }
        }
        return ans;
    }
    
    static int pow(int x, int p) {
        if (p == 0) {
            return 1;
        } else if (p % 2 == 0) {
            return pow(x * x % MOD, p / 2);
        } else {
            return pow(x, p - 1) * x % MOD;
        }
    }
    
    static int check(int idx, ArrayList<Integer> list) {
        if (idx < 0) {
            return 0;
        }
        ArrayList<Integer> odd  = new ArrayList<>();
        ArrayList<Integer> ev = new ArrayList<>();
        for (int x : list) {
            if ((x & (1 << idx)) == 0) {
                ev.add(x);
            } else {
                odd.add(x);
            }
        }
        if (ev.size() == 0) {
            return check(idx - 1, odd);
        } else if (odd.size() == 0) {
            return check(idx - 1, ev);
        } else {
            return Math.min(check(idx - 1, odd), check(idx - 1, ev)) + (1 << idx);
        }
    }
}

class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}