神奇数

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    static final int N = 210, mod = 998244353;
    static int[] a = new int[N];
    static long[][][] f = new long[N][10][2];
    static int n;

    //is_num避开非数的干扰
    static long dfs(int u, int lim, boolean is_num, int op, int yu) {
        if (u == n) {
            if (!is_num) return 0;
            if (lim == 1 && op > a[u]) return 0;
            return (yu % op == 0) ? 1 : 0;
        }
        if (is_num && f[u][yu][lim] != -1)
            return f[u][yu][lim];

        long res = 0;
        int up = (lim == 1) ? a[u] : 9;
        for (int i = 0; i <= up; i++) {
            res = (res + dfs(u + 1, lim & (i == up ? 1 : 0), is_num || i != 0, op, (yu + i) % op)) % mod;
        }

        if (is_num) f[u][yu][lim] = res;

        return res;
    }

    static void init() {
        for (int i = 0; i < N; i++)
            for (int j = 0; j < 10; j++) {
                Arrays.fill(f[i][j], -1);
            }
    }

    static long get(String t) {
        n = t.length();
        for (int i = 1; i <= n; i++) a[i] = t.charAt(i - 1) - '0';
        long res = 0;
        for (int op = 1; op <= 9; op++) {
            init();
            res = (res + dfs(1, 1, false, op, 0)) % mod;
        }
        return res;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        long ans = -get(s) + check();
        ans += get(sc.nextLine());

        System.out.println((ans % mod + mod) % mod);
    }

    static int check() {
        if (a[n] == 0) return 0;
        int sum = 0;
        for (int i = 1; i < n; i++) sum += a[i];
        return sum % a[n] == 0 ? 1 : 0;
    }
}