#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<60);

template <unsigned long long mod > class modint{
public:
    ll x;
    constexpr modint(){x = 0;}
    constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}
    constexpr modint operator-(){
        return x == 0 ? 0 : mod - x;
    }
    constexpr modint& operator+=(const modint& a){
        if((x += a.x) >= mod) x -= mod;
        return *this;
    }
    constexpr modint operator+(const modint& a) const{
        return modint(*this) += a;
    }
    constexpr modint& operator-=(const modint& a){
        if((x -= a.x) < 0) x += mod;
        return *this;
    }
    constexpr modint operator-(const modint& a) const{
        return modint(*this) -= a;
    }
    constexpr modint& operator*=(const modint& a){
        (x *= a.x)%=mod;
        return *this;
    }
    constexpr modint operator*(const modint& a) const{
        return modint(*this) *= a;
    }
    constexpr modint pow(unsigned long long pw) const{
        modint res(1), comp(*this);
        while(pw){
            if(pw&1) res *= comp;
            comp *= comp;
            pw >>= 1;
        }
        return res;
    }
    //以下、modが素数のときのみ
    constexpr modint inv() const{
        return modint(*this).pow(mod - 2);
    }
    constexpr modint& operator/=(const modint &a){
        (x *= a.inv().x)%=mod;
        return *this;
    }
    constexpr modint operator/(const modint &a) const{
        return modint(*this) /= a;
    }
};
#define mod1 998244353
using mint = modint<mod1>;

ostream& operator<<(ostream& os, const mint& a){
    os << a.x;
    return os;
}
using vm = vector<mint>;
class NTT{
    const int root;

    void make_root_pow(int n, vm &root_pow){
        root_pow.resize(n + 1);
        mint new_root = mint(root).pow((mod1 - 1) / n);
        root_pow[0].x = 1;
        rep(i,n){
            root_pow[i + 1] = root_pow[i] * new_root;
        }
    }
    static void make_bit_reverse(int n, vector<int> &v){
        rep(i,n) v[i] = i;
        for(int i = 1; (1<<i) <= n; ++i){
            int l = 1<<(i - 1), r = 1<<i;
            int plus = n >> i;
            for(int j = l; j < r; ++j){
                int temp = v[j - l] + plus;
                if(j < temp) swap(v[j], v[temp]);
            }
        }
    }
    static void dft(int n, vm &f, bool inv, vm &root_pow, vector<int> &id){
        vm g(n);
        rep(i,n) g[i] = f[id[i]];
        swap(f, g);
        for(int l = n / 2, len = 1; l >= 1; l /= 2, len *= 2){
            for(int i = 0; i < n; i += len * 2){
                rep(j, len){
                    mint z = inv ? root_pow[n - l * j] : root_pow[l * j];
                    g[i + j] = f[i + j] + (z * f[i + len + j]);
                    g[i + len + j] = f[i + j] - (z * f[i + len + j]);
                }
            }
            swap(f, g);
        }
        if(inv) {
            mint n_inv = mint(n).inv();
            rep(i, n) f[i] *= n_inv;
        }
    }
public:
    NTT(int _x = 3) : root(_x){}
    vm convolution(vm &a, vm &b){
        int sz = a.size() + b.size() - 1, n = 1;
        while(sz > n) n *= 2;
        vm g(n, 0), h(n, 0), root_pow(n + 1, 1), gh(n);
        vector<int> id(n);
        rep(i, (int)a.size()) g[i] = a[i];
        rep(i, (int)b.size()) h[i] = b[i];
        make_root_pow(n, root_pow);
        make_bit_reverse(n, id);
        dft(n, g, false, root_pow, id);
        dft(n, h, false, root_pow, id);
        rep(i, n) gh[i] = g[i] * h[i];
        dft(n, gh, true, root_pow, id);
        gh.resize(sz);
        return gh;
    }
};

int main() {
    cin>>N>>M;
    NTT ntt;
    vm a(N), b(M);
    rep(i, N) scanf("%lld", &a[i].x);
    rep(i, M) scanf("%lld", &b[i].x);
    vm c = ntt.convolution(a, b);
    rep(i, N + M - 1) printf("%lld%c", c[i].x, " \n"[i == N + M - 2]);
}


Measured memory_bytes: 56672