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

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; const int inf = 0x3fffffff; const ll INF = 0x3fffffffffffffff;
template<class T> inline bool chmax(T& a,T b){ if(a<b){a=b;return 1;}return 0; }
template<class T> inline bool chmin(T& a,T b){ if(a>b){a=b;return 1;}return 0; }
//template end

int mod=998244353;
struct Mint {
    int val;
    Mint inv() const{
        int tmp,a=val,b=mod,x=1,y=0;
        while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y);
        return Mint(x);
    }
public:
    Mint():val(0){}
    Mint(ll x){if((val=x%mod)<0)val+=mod;}
    Mint pow(ll t){Mint res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;}return res;}
    Mint& operator+=(const Mint& x){if((val+=x.val)>=mod)val-=mod;return *this;}
    Mint& operator-=(const Mint& x){if((val+=mod-x.val)>=mod)val-=mod; return *this;}
    Mint& operator*=(const Mint& x){val=(ll)val*x.val%mod; return *this;}
    Mint& operator/=(const Mint& x){return *this*=x.inv();}
    Mint operator+(const Mint& x) const{return Mint(*this)+=x;}
    Mint operator-(const Mint& x) const{return Mint(*this)-=x;}
    Mint operator*(const Mint& x) const{return Mint(*this)*=x;}
    Mint operator/(const Mint& x) const{return Mint(*this)/=x;}
};
struct factorial {
    vector<Mint> Fact, Finv;
public:
    factorial(int maxx){
        Fact.resize(maxx+1),Finv.resize(maxx+1); Fact[0]=Mint(1); rep(i,0,maxx)Fact[i+1]=Fact[i]*(i+1);
        Finv[maxx]=Mint(1)/Fact[maxx]; rrep(i,maxx,0)Finv[i-1]=Finv[i]*i;
    }
    Mint fact(int n,bool inv=0){if(inv)return Finv[n];else return Fact[n];}
    Mint nPr(int n,int r){if(n<0||n<r||r<0)return Mint(0);else return Fact[n]*Finv[n-r];}
    Mint nCr(int n,int r){if(n<0||n<r||r<0)return Mint(0);else return Fact[n]*Finv[r]*Finv[n-r];}
};

int get_root(int m){
    rep(i,2,m){
        set<int> st; int x=1;
        while(1){
            if(st.size()==m-1)return i;
            if(st.count(x))break;
            st.insert(x); x=x*i%m;
        }
    }return -1;
}
Mint prt=3;
void ntt(vector<Mint> &a,bool inv=0){
    int s=a.size(),t=s/2-1; if(s==1)return;
    vector<Mint> ev(s/2),od(s/2);
    rep(i,0,s/2)ev[i]=a[i*2],od[i]=a[i*2+1]; ntt(ev,inv); ntt(od,inv);
    Mint w_0=prt.pow((mod-1)/s),w=1; if(inv)w_0=w_0.inv();
    rep(i,0,s)a[i]=ev[i&t]+w*od[i&t],w*=w_0;
}
void v_mul(vector<int> &a,vector<int> b){
    int n=1; while(n<a.size()+b.size()-1)n<<=1;
    vector<Mint> x(n),y(n);
    rep(i,0,a.size())x[i]=Mint(a[i]); rep(i,0,b.size())y[i]=Mint(b[i]);
    ntt(x); ntt(y); rep(i,0,n)x[i]*=y[i];
    ntt(x,1); rep(i,0,n)x[i]/=n; a.resize(n); rep(i,0,n)a[i]=x[i].val;
}

int main(){
    int p; scanf("%d",&p);
    vector<int> x(p),y(p);
    rep(i,1,p)scanf("%d",&x[i]);
    rep(i,1,p)scanf("%d",&y[i]);
    if(p==2){
        printf("%lld\n",(1LL*x[1]*y[1])%p); return 0;
    }
    int rt=get_root(p);
    vector<int> a(100010),b(100010); int idx=1;
    rep(i,0,p-1){
        a[i]=x[idx]; b[i]=y[idx]; idx=(idx*rt)%p;
    }
    v_mul(a,b); vector<Mint> ans(p,0); idx=1;
    rep(i,0,a.size()){
        ans[idx]+=a[i]; idx=idx*rt%p;
    }
    rep(i,1,p)printf("%d\n",ans[i].val);
    return 0;
}