H open

/*
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃＼○／
┛┗┛┗┛┃ / /
┓┏┓┏┓┃ノ
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃
┛┗┛┗┛┃
┓┏┓┏┓┃┓
┛┗┛┗┛┃┃
      MIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSICMIPTCLASSIC
*/

// #define pragma

#ifdef pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Wunused-result"
#endif // pragma

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define all(x) begin(x), end(x)
#define pb push_back
#define x first
#define y second
#define int long long
#define zero(two) memset(two, 0, sizeof(two))

using namespace std;
using namespace __gnu_pbds;


typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef long double ld;
typedef vector<vi> matrix;
template<typename T>
using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ld PI = atan2(0, -1);

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(10);
    #if 1
        freopen("input", "r", stdin);
        freopen("output", "w", stdout);
    #endif
}

const int MOD = 998244353ll;

signed main() {
    seriy();
    string l, r;
    cin >> l >> r;
    string ans = "";
    int cur = 0;
    reverse(all(l));
    while(l.size() < r.size()) {
        l += '0';
    }
    reverse(all(l));
    while(cur < l.size() && l[cur] == r[cur]) {
        ans += l[cur];
        cur++;
    }
    if(cur == l.size()) {
        ans = r;
        int k = 1;
        for(auto i : ans) {
            k *= (i - '0');
            k %= MOD;
        }
        return cout << k, 0;
    }
    string h = r.substr(cur, r.size() - cur);
    if(h[0] == '1' && cur == 0) {
        int k = 1;
        for(int i = 0; i < h.size() - 1; i++) {
            k *= 9;
            k %= MOD;
            // cout << 9;
        }
        cout << k;
        return 0;
    }
    reverse(all(h));
    while(h.size() && h.back() == '1') {
        ans += '1';
        h.pop_back();
    }
    reverse(all(h));
    string bst = h;
    string def = h;
    int t = min(16ll, (int)h.size());
    int mx = 1;
    for(int i = 0; i < t; i++) {
        mx *= (h[i] - '0');
    }
    for(int i = 0; i < t - 1; i++) {
        if(h[i] == '1') {
            continue;
        }
        int mul = 1;
        for(int j = 0; j < t; j++) {
            if(j < i) {
                mul *= (h[j] - '0');
            }
            else if(j > i) {
                mul *= 9;
            }
            else {
                mul *= (h[j] - '0' - 1);
            }
            // mul %= MOD;
        }
        if(mul > mx) {
            mx = mul;
            bst = "";
            for(int j = 0; j < h.size(); j++) {
                if(j < i) {
                    bst += h[j];
                }
                else if(j > i) {
                    bst += '9';
                }
                else {
                    bst += (char)(h[j] - 1);
                }
            }
        }
        // cerr << mul << '\n';
    }
    ans += bst;
    int k = 1;
    for(auto i : ans) {
        k *= (i - '0');
        // cerr << k << " ";
        k %= MOD;
        // cerr << k << '\n';
    }
    cout << k << '\n';
    // cout << ans;
    return 0;
}