#include <bits/stdc++.h>
using namespace std;

const long long MOD = 998244353;
const long long G = 3;

long long powerMod(long long a, long long b) {
    long long res = 1;
    a %= MOD;
    while (b > 0) {
        if (b & 1) res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

void ntt(vector<long long>& a, bool inv) {
    int n = a.size();
    for (int i = 1, j = 0; i < n; i++) {
        int bit = n >> 1;
        for (; j & bit; bit >>= 1) j ^= bit;
        j ^= bit;
        if (i < j) swap(a[i], a[j]);
    }
    for (int len = 2; len <= n; len <<= 1) {
        long long wlen = powerMod(G, (MOD - 1) / len);
        if (inv) wlen = powerMod(wlen, MOD - 2);
        for (int i = 0; i < n; i += len) {
            long long w = 1;
            for (int j = 0; j < len / 2; j++) {
                long long u = a[i + j];
                long long v = a[i + j + len / 2] * w % MOD;
                a[i + j] = (u + v) % MOD;
                a[i + j + len / 2] = (u - v + MOD) % MOD;
                w = w * wlen % MOD;
            }
        }
    }
    if (inv) {
        long long inv_n = powerMod(n, MOD - 2);
        for (long long& x : a) x = x * inv_n % MOD;
    }
}

int main() {
    string s, t;
    cin >> s >> t;

    // Xu ly truong hop 0
    if (s == "0" || t == "0") {
        cout << 0 << endl;
        return 0;
    }

    int n = s.size(), m = t.size();

    // Tim kich thuoc NTT
    int sz = 1;
    while (sz < n + m) sz <<= 1;

    vector<long long> a(sz, 0), b(sz, 0);

    // Chuyen so thanh da thuc: chu so hang don vi o bac 0
    for (int i = 0; i < n; i++) a[i] = s[n - 1 - i] - '0';
    for (int i = 0; i < m; i++) b[i] = t[m - 1 - i] - '0';

    // Nhan NTT
    ntt(a, false);
    ntt(b, false);
    for (int i = 0; i < sz; i++) a[i] = a[i] * b[i] % MOD;
    ntt(a, true);

    // Xu ly nho
    for (int i = 0; i < n + m - 1; i++) {
        a[i + 1] += a[i] / 10;
        a[i] %= 10;
    }

    // In ket qua (bo qua so 0 o dau)
    int len = n + m - 1;
    while (a[len] > 0) {
        a[len + 1] += a[len] / 10;
        a[len] %= 10;
        len++;
    }

    for (int i = len - 1; i >= 0; i--) cout << a[i];
    cout << endl;

    return 0;
}