#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

//数論変換(任意mod上での畳み込み)
//計算量 O((N+M)*log(N+M))

template<int mod>
struct Mod_Int{
    ll x;

    Mod_Int() = default;

    Mod_Int(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    Mod_Int &operator += (const Mod_Int &p){
        x = (x + p.x) % mod;
        return *this;
    }

    Mod_Int &operator -= (const Mod_Int &p){
        x = (x + mod - p.x) % mod;
        return *this;
    }

    Mod_Int &operator *= (const Mod_Int &p){
        x = (x * p.x) % mod;
        return *this;
    }

    Mod_Int &operator /= (const Mod_Int &p){
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator ++ () {return *this += Mod_Int(1);}

    Mod_Int operator ++ (int){
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator -- () {return *this -= Mod_Int(1);}

    Mod_Int operator -- (int){
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator - () const {return Mod_Int(-x);}

    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}

    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}

    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}

    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}

    bool operator == (const Mod_Int &p) const {return x == p.x;}

    bool operator != (const Mod_Int &p) const {return x != p.x;}

    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod-2);
    }

    Mod_Int pow(ll k) const{
        Mod_Int now = *this, ret = 1;
        while(k){
            if(k&1) ret *= now;
            now *= now, k >>= 1;
        }
        return ret;
    }

    friend ostream &operator << (ostream &os, const Mod_Int &p){
        return os << p.x;
    }

    friend istream &operator >> (istream &is, Mod_Int &p){
        ll a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

template<typename T>
struct Euclid{
    Euclid() = default;

    T gcd(const T &a, const T &b) const{
        if(b == 0) return a;
        else return gcd(b, a%b);
    }

    T lcm(const T &a, const T &b) const {return a*(b/gcd(a,b));}

    T extgcd(const T &a, const T &b, T &x, T &y) const{
        if(b == 0) {x = 1, y = 0; return a;}
        T g = extgcd(b, a%b, y, x);
        y -= (a/b)*x;
        return g;
    }

    T mod(const T &a, const T &m) const{
        T ret = a%m;
        return ret+(ret < 0? m : 0);
    }

    T modinv(const T &a, const T &m) const{ //aとmは互いに素
        T x, y;
        extgcd(a, m, x, y);
        return mod(x, m);
    }

    T floor_sum(const T &n, const T &m, T a, T b) const{ //Σ(floor((a*i+b)/m)) (0<=i<n)
        T ret = (a/m)*(n*(n-1)/2) + (b/m)*n;
        a %= m, b %= m;
        T y = (a*n+b)/m;
        if(y == 0) return ret;
        ret += floor_sum(y, a, m, a*n-(m*y-b));
        return ret;
    }

    pair<T, T> Chinese_rem(const T &a1, const T &m1, const T &a2, const T &m2) const{
        T x, y, g = extgcd(m1, m2, x, y);
        if((a2-a1)%g != 0) return make_pair(0, -1);
        T m = m1*(m2/g);
        T tmp = mod(x*((a2-a1)/g), m2/g);
        T a = (m1*tmp+a1) % m;
        return make_pair(a, m);
    }

    T Garner(vector<T> a, vector<T> m, const T &M) const{
        m.pb(M);
        vector<T> coeffs(sz(m), 1);
        vector<T> constants(sz(m), 0);
        rep(k, sz(a)){
            T t = mod((a[k]-constants[k]) * modinv(coeffs[k], m[k]), m[k]);
            rep2(i, k+1, sz(m)-1){
                constants[i] += t*coeffs[i], constants[i] %= m[i];
                coeffs[i] *= m[k], coeffs[i] %= m[i];
            }
        }
        return constants.back();
    }
};

template<int mod, int primitive_root>
struct Number_Theorem_Transform{
    using Mint = Mod_Int<mod>;

    const int y, x;
    vector<Mint> pw;

    Number_Theorem_Transform() : y(__builtin_ctz(mod-1)), x(mod>>y){
        pw.resize(y);
        pw[0] = Mint(primitive_root).pow(x);
        rep(i, y-1) pw[i+1] = pw[i]*pw[i];
    }

    vector<Mint> to_Mint(vector<int> a){
        vector<Mint> ret(sz(a));
        rep(i, sz(a)) ret[i] = Mint(a[i]);
        return ret;
    }

    vector<int> to_int(vector<Mint> a){
        vector<int> ret(sz(a));
        rep(i, sz(a)) ret[i] = int(a[i].x);
        return ret;
    }

    void ntt(vector<Mint> &a, int n, bool inverse = false){
        assert((n&(n-1)) == 0);
        a.resize(n);
        rep(i, n){
            int j = 0;
            for(int k = 0; k < __builtin_ctz(n); k++){
                if(i&(1<<k)) j |= 1<<(__builtin_ctz(n)-1-k);
            }
            if(i < j) swap(a[i], a[j]);
        }
        for(int k = 1; k < n; k *= 2){
            Mint w = 1, r = pw[y-1-__builtin_ctz(k)];
            if(inverse) r = r.inverse();
            rep(i, k){
                for(int j = 0; j < n; j += 2*k){
                    Mint s = a[j+i], t = a[j+k+i]*w;
                    a[j+i] = s+t, a[j+k+i] = s-t;
                }
                w *= r;
            }
        }
        if(inverse) rep(i, n) a[i] /= Mint(n);
    }

    vector<int> convolve(vector<int> a, vector<int> b){
        int n = 1<<(32-__builtin_clz(sz(a)+sz(b)-2));
        vector<Mint> A = to_Mint(a), B = to_Mint(b), C(n);
        ntt(A, n), ntt(B, n);
        rep(i, n) C[i] = A[i]*B[i];
        ntt(C, n, true);
        vector<int> c = to_int(C);
        c.resize(sz(a)+sz(b)-1);
        return c;
    }
};

template<int mod>
struct Arbitary_Mod_Number_Theorem_Transfrom{
    Number_Theorem_Transform<924844033, 5> NTT_1;
    Number_Theorem_Transform<1012924417, 5> NTT_2;
    Number_Theorem_Transform<1224736769, 3> NTT_3;
    Euclid<ll> E;

    Arbitary_Mod_Number_Theorem_Transfrom() = default;

    vector<int> convolve(vector<int> a, vector<int> b){
        vector<int> x = NTT_1.convolve(a, b);
        vector<int> y = NTT_2.convolve(a, b);
        vector<int> z = NTT_3.convolve(a, b);
        vector<int> c(sz(a)+sz(b)-1);
        rep(i, sz(a)+sz(b)-1){
            vector<ll> p = {x[i], y[i], z[i]};
            vector<ll> q = {924844033, 1012924417, 1224736769};
            c[i] = E.Garner(p, q, mod);
        }
        return c;
    }
};

int main(){
    int N, M;
    cin >> N >> M;
    Arbitary_Mod_Number_Theorem_Transfrom<998244353> ntt;
    vector<int> a(N), b(M);
    rep(i, N) cin >> a[i];
    rep(i, M) cin >> b[i];
    vector<int> c = ntt.convolve(a, b);
    for(auto &e: c) cout << e << ' ';
    cout << endl;
}

Measured memory_bytes: 62620