#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T1,typename T2,typename T3>istream &operator>>(istream &is,tuple<T1,T2,T3>&a){is>>std::get<0>(a)>>std::get<1>(a)>>std::get<2>(a);return is;}
template<typename T,size_t n>istream &operator>>(istream &is,array<T,n>&a){for(auto&i:a)is>>i;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define overload3(_1,_2,_3,name,...) name
#define rep1(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define reps(i,l,r) rep2(i,l,r)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
#define yn(x) cout<<((x)?"Yes\n":"No\n")
#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())
template<typename T>
inline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
#ifdef LOCAL
#include<debug.h>
#define SWITCH(a,b) (a)
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define SWITCH(a,b) (b)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
struct Timer{
  clock_t start;
  Timer(){
    start=clock();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout<<fixed<<setprecision(16);
  }
  inline double now(){return (double)(clock()-start)/1000;}
  #ifdef LOCAL
  ~Timer(){
    cerr<<"time:";
    cerr<<now();
    cerr<<"ms\n";
  }
  #endif
}timer;
void SOLVE();
int main(){
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
}
#include<initializer_list>
constexpr bool isprime_constexpr(unsigned long long n){
  if(n==998244353)return true;
  if(n==1000000007)return true;
  if(n<64)return 2891462833508853932ll>>n&1;
  if(n%2==0)return false;
  unsigned long long d=n-1;
  int s=0;
  while(!(d&1))d>>=1,s++;
  int q=63;
  while(!(d>>q))q--;
  unsigned long long r=n;
  for(int i=0;i<5;i++)r*=2-r*n;
  auto redc=[&r,&n](__uint128_t x)->unsigned long long {
    x=(x+__uint128_t((unsigned long long)x*-r)*n)>>64;
    return x>=n?x-n:x;
  };
  __uint128_t r2=-__uint128_t(n)%n;
  unsigned long long one=redc(r2);
  for(unsigned long long base:{2,325,9375,28178,450775,9780504,1795265022}){
    if(base%n==0)continue;
    unsigned long long a=base=redc((base%n)*r2);
    for(int i=q-1;i>=0;i--){
      a=redc(__uint128_t(a)*a);
      if(d>>i&1)a=redc(__uint128_t(a)*base);
    }
    if(a==one)continue;
    for(int i=1;a!=n-one;i++){
      if(i>=s)return false;
      a=redc(__uint128_t(a)*a);
    }
  }
  return true;
}
constexpr int factorize_constexpr(unsigned long long n,unsigned long long*a){
  if(n<=1)return 0;
  int ptr=0;
  while(n%2==0){
    a[ptr++]=2;
    n/=2;
  }
  while(n>1){
    if(isprime_constexpr(n)){
      a[ptr++]=n;
      break;
    }
    unsigned long long pf=n;
    unsigned long long x=0,y=0;
    int c=1;
    do{
      x=((__uint128_t)x*x+c)%pf;
      y=((__uint128_t)y*y+c)%pf;
      y=((__uint128_t)y*y+c)%pf;
      unsigned long long g=std::gcd(x>y?x-y:y-x,pf);
      if(g==pf){
        c++;
        x=y=0;
        continue;
      }
      if(g>1)pf=g;
    }while(!isprime_constexpr(pf));
    while(n%pf==0){
      a[ptr++]=pf;
      n/=pf;
    }
  }
  return ptr;
}
#include<type_traits>
template<typename T>
constexpr std::enable_if_t<(std::numeric_limits<T>::digits<=32),T>pow_mod(T a,T n,T mod){
  using u64=unsigned long long;
  u64 res=1;
  while(n>0){
    if(n&1)res=((u64)res*a)%mod;
    a=((u64)a*a)%mod;
    n>>=1;
  }
  return T(res);
}
template<typename T>
constexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),T>pow_mod(T a,T n,T mod){
  using u128=__uint128_t;
  u128 res=1;
  while(n>0){
    if(n&1)res=((u128)res*a)%mod;
    a=((u128)a*a)%mod;
    n>>=1;
  }
  return T(res);
}
namespace Random{
constexpr unsigned long long to_seed(const char*s){
  unsigned long long h=14695981039346656037ULL;
  while(*s){
    h^=static_cast<unsigned char>(*s++);
    h*=1099511628211ULL;
  }
  return h;
}
constexpr unsigned long long constexpr_random_seed=(to_seed(__TIME__)*0x9e3779b97f4a7c15ULL)^to_seed(__DATE__);
constexpr unsigned long long next_value(unsigned long long n){
  n^=n<<13;
  n^=n>>7;
  n^=n<<17;
  return n;
}
}
constexpr unsigned long long primitive_root_constexpr(unsigned long long x){
  if(!isprime_constexpr(x))throw "not prime";
  if(x==167772161)return 3;
  if(x==469762049)return 3;
  if(x==754974721)return 11;
  if(x==880803841)return 26;
  if(x==998244353)return 3;
  if(x==2)return 1;
  unsigned long long a[64]={};
  int ptr=factorize_constexpr(x-1,a);
  for(unsigned long long v=Random::constexpr_random_seed;;){
    unsigned long long g=v%(x-1)+1;
    bool ok=true;
    for(int i=0;i<ptr;i++){
      if(i>0&&a[i-1]==a[i])continue;
      if(pow_mod<unsigned long long>(g,(x-1)/a[i],x)==1){
        ok=false;
        break;
      }
    }
    if(ok)return g;
    v=Random::next_value(v);
  }
}
#include<concepts>
template<typename T>
constexpr std::enable_if_t<std::numeric_limits<T>::digits<=32,int>msb(T n){return n==0?-1:31-__builtin_clz(n);}
template<typename T>
constexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),int>msb(T n){return n==0?-1:63-__builtin_clzll(n);}

template<typename T>
constexpr std::enable_if_t<std::numeric_limits<T>::digits<=32,int>lsb(T n){return n==0?-1:__builtin_ctz(n);}
template<typename T>
constexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),int>lsb(T n){return n==0?-1:__builtin_ctzll(n);}

template<typename T>
constexpr std::enable_if_t<std::is_integral_v<T>,T>floor_pow2(T n){return n==0?0:T(1)<<msb(n);}

template<typename T>
constexpr std::enable_if_t<std::is_integral_v<T>,T>ceil_pow2(T n){return n<=1?1:T(1)<<(msb(n-1)+1);}

template<std::integral T>
constexpr T safe_div(T a,T b){return a/b-(a%b&&(a^b)<0);}
template<std::integral T>
constexpr T safe_ceil(T a,T b){return a/b+(a%b&&(a^b)>0);}
template<auto m>
struct ntt_root{
  static_assert(1<=m&&m<(1ull<<63));
  static_assert(isprime_constexpr(m));
  using value_type=std::conditional_t<((m>>31)==0),uint32_t,uint64_t>;
  using mul_type=std::conditional_t<((m>>31)==0),uint64_t,__uint128_t>;
  static constexpr int rank2=lsb(m-1);
  static constexpr value_type g=primitive_root_constexpr(m);
  std::array<value_type,rank2+1>root,invroot;
  std::array<value_type,std::max(0,rank2-1)>rate2,invrate2;
  std::array<value_type,std::max(0,rank2-2)>rate3,invrate3;
  constexpr ntt_root(){
    root[rank2]=pow_mod<value_type>(g,m>>rank2,m);
    invroot[rank2]=pow_mod<value_type>(root[rank2],m-2,m);
    for(int i=rank2-1;i>=0;i--){
      root[i]=(mul_type)root[i+1]*root[i+1]%m;
      invroot[i]=(mul_type)invroot[i+1]*invroot[i+1]%m;
    }
    value_type prod=1,invprod=1;
    for(int i=0;i<rank2-1;i++){
      rate2[i]=(mul_type)root[i+2]*prod%m;
      invrate2[i]=(mul_type)invroot[i+2]*invprod%m;
      prod=(mul_type)prod*invroot[i+2]%m;
      invprod=(mul_type)invprod*root[i+2]%m;
    }
    prod=invprod=1;
    for(int i=0;i<rank2-2;i++){
      rate3[i]=(mul_type)root[i+3]*prod%m;
      invrate3[i]=(mul_type)invroot[i+3]*invprod%m;
      prod=(mul_type)prod*invroot[i+3]%m;
      invprod=(mul_type)invprod*root[i+3]%m;
    }
  }
};
template<typename T>
void dft(std::vector<T>&a){
  using value_type=typename T::value_type;
  using mul_type=typename T::mul_type;
  #ifdef NTT_SIMD
  if constexpr(std::numeric_limits<value_type>::digits<=32){
    if((int)a.size()>=32){
      dft_simd(a);
      return;
    }
  }
  #endif
  static constexpr ntt_root<T::mod()>r;
  static constexpr mul_type mod2=(mul_type)T::mod()*T::mod();
  int n=a.size();
  int h=lsb(n);
  int len=0;
  while(len<h){
    if(h-len==1){
      T rot=T::raw(1);
      for(int s=0;s<(1<<len);s++){
        int of=s*2;
        T u=a[of],v=a[of+1]*rot;
        a[of]=u+v;
        a[of+1]=u-v;
        rot*=T::raw(r.rate2[lsb(~(unsigned int)s)]);
      }
      len++;
    }
    else{
      int p=1<<(h-len-2);
      T rot=T::raw(1),imag=T::raw(r.root[2]);
      for(int s=0;s<(1<<len);s++){
        const mul_type rot1=rot.val(),rot2=(rot*rot).val(),rot3=(rot*T::raw(rot2)).val();
        int of=s<<(h-len);
        for(int i=0;i<p;i++){
          const mul_type a0=a[i+of].val(),a1=(mul_type)a[i+of+p].val()*rot1,a2=(mul_type)a[i+of+p*2].val()*rot2,a3=(mul_type)a[i+of+p*3].val()*rot3;
          const mul_type m=(mul_type)T(a1+mod2-a3).val()*imag.val();
          const mul_type k=mod2-a2;
          a[i+of]=a0+a2+a1+a3;
          a[i+of+p]=a0+a2+(mod2*2-a1-a3);
          a[i+of+p*2]=a0+k+m;
          a[i+of+p*3]=a0+k+(mod2-m);
        }
        rot*=T::raw(r.rate3[lsb(~(unsigned int)s)]);
      }
      len+=2;
    }
  }
}
template<typename T>
void idft(std::vector<T>&a){
  using value_type=typename T::value_type;
  using mul_type=typename T::mul_type;
  #ifdef NTT_SIMD
  if constexpr(std::numeric_limits<value_type>::digits<=32){
    if((int)a.size()>=32){
      idft_simd(a);
      return;
    }
  }
  #endif
  static constexpr ntt_root<T::mod()>r;
  int n=a.size();
  int h=lsb(n);
  int len=h;
  while(len){
    if(len==1){
      int p=1<<(h-1);
      for(int i=0;i<p;i++){
        T u=a[i],v=a[i+p];
        a[i]=u+v;
        a[i+p]=u-v;
      }
      len--;
    }
    else{
      int p=1<<(h-len);
      T rot=T::raw(1),imag=T::raw(r.invroot[2]);
      for(int s=0;s<(1<<(len-2));s++){
        const mul_type rot1=rot.val(),rot2=(rot*rot).val(),rot3=(rot*T::raw(rot2)).val();
        int of=s<<(h-len+2);
        for(int i=0;i<p;i++){
          const mul_type a0=a[i+of].val(),a1=a[i+of+p].val(),a2=a[i+of+p*2].val(),a3=a[i+of+p*3].val();
          const mul_type k=T((T::mod()+a2-a3)*imag.val()).val();
          a[i+of]=a0+a1+a2+a3;
          a[i+of+p]=(a0+T::mod()-a1+k)*rot1;
          a[i+of+p*2]=(a0+a1+T::mod()*2-a2-a3)*rot2;
          a[i+of+p*3]=(a0+T::mod()*2-a1-k)*rot3;
        }
        rot*=T::raw(r.invrate3[lsb(~(unsigned int)s)]);
      }
      len-=2;
    }
  }
}
template<typename T>
std::vector<T>ntt_convolution(std::vector<T> a,std::vector<T> b){
  int n=a.size(),m=b.size(),s=n+m-1;
  if(std::min(n,m)<60){
    if(n==0||m==0)return {};
    std::vector<T>ret(s,0);
    if(n<m)for(int i=0;i<m;i++)for(int j=0;j<n;j++)ret[i+j]+=a[j]*b[i];
    else for(int i=0;i<n;i++)for(int j=0;j<m;j++)ret[i+j]+=a[i]*b[j];
    return ret;
  }
  int z=ceil_pow2(s);
  a.resize(z,0);
  b.resize(z,0);
  dft(a),dft(b);
  std::vector<T>c(z);
  for(int i=0;i<z;i++)c[i]=a[i]*b[i];
  idft(c);
  T g=T::raw(z).inv();
  for(int i=0;i<s;i++)c[i]*=g;
  return {c.begin(),c.begin()+s};
}
struct is_modint_impl{
  template<typename T>
  static auto check(T&&x)->decltype(x.mod(),std::true_type{});
  template<typename T>
  static auto check(...)->std::false_type;
};
template<typename T>
struct is_modint:public decltype(is_modint_impl::check<T>(std::declval<T>())){};
template<typename T>
inline constexpr bool is_modint_v=is_modint<T>::value;
struct is_dynamic_modint_impl{
  template<typename T>
  static auto check(T&&x)->decltype(x.set_mod((typename T::value_type)0),std::true_type{});
  template<typename T>
  static auto check(...)->std::false_type;
};
template<typename T>
struct is_dynamic_modint:public decltype(is_dynamic_modint_impl::check<T>(std::declval<T>())){};
template<typename T>
inline constexpr bool is_dynamic_modint_v=is_dynamic_modint<T>::value;
template<typename T>
inline constexpr bool is_static_modint_v=is_modint_v<T>&&!is_dynamic_modint_v<T>;
struct is_uso_modint_impl{
  template<typename T>
  static auto check(T&&x)->decltype(x.uso(),std::true_type{});
  template<typename T>
  static auto check(...)->std::false_type;
};
template<typename T>
struct is_uso_modint:public decltype(is_uso_modint_impl::check<T>(std::declval<T>())){};
template<typename T>
inline constexpr bool is_uso_modint_v=is_uso_modint<T>::value;
template<typename T>
struct F{
private:
  static int capacity;
  static std::vector<T>fact,factinv,inv;
public:
  static void resize(int n){
    if(capacity>=n)return;
    fact.resize(n+1),factinv.resize(n+1),inv.resize(n+1);
    for(int i=capacity+1;i<=n;i++){
      fact[i]=fact[i-1]*T::raw(i);
      if constexpr(is_uso_modint_v<T>)inv[i]=T(1)/T(i);
      else inv[i]=-inv[T::mod()%i]*(T::mod()/i);
      factinv[i]=factinv[i-1]*inv[i];
    }
    capacity=n;
  }
  static T C(int n,int k){
    if(n<k)return 0;
    if(k<0)return 0;
    resize(n);
    return fact[n]*factinv[k]*factinv[n-k];
  }
  static T P(int n,int k){
    if(n<k)return 0;
    if(k<0)return 0;
    resize(n);
    return fact[n]*factinv[n-k];
  }
  static T H(int n,int k){
    if(n==0&&k==0)return 1;
    return C(n+k-1,k);
  }
  static T factorial(int n){
    resize(n);
    return fact[n];
  }
  static T factorial_inv(int n){
    resize(n);
    return factinv[n];
  }
  static T inverse(int n){
    resize(n);
    return inv[n];
  }
  static T S(long long n,int k){
    if(n<0)return 0;
    if(n<k)return 0;
    T ret=0;
    resize(k);
    for(int i=0;i<=k;i++){
      ret+=fact[k]*factinv[i]*factinv[k-i]*T::raw(i).pow(n)*((k-i)&1?-1:1);
    }
    return ret*factinv[k];
  }
  template<typename... INT>
  static T O(INT...k){
    int n=0;
    for(int i:std::initializer_list<int>{k...}){
      if(i<0)return 0;
      n+=i;
    }
    resize(n);
    T ret=fact[n];
    for(int i:std::initializer_list<int>{k...})ret*=factinv[i];
    return ret;
  }
  static T rising_factorial(int x,int n){
    assert(n>=0);
    if(x>0){
      resize(x+n-1);
      return fact[x+n-1]*factinv[x-1];
    }
    else if(x+n>0)return T();
    else{
      resize(-x);
      T res=fact[-x]*factinv[-x-n];
      if(n&1)res=-res;
      return res;
    }
  }
  static T falling_factorial(int x,int n){return rising_factorial(x-n+1,n);}
};
template<typename T>int F<T>::capacity=1;
template<typename T>std::vector<T>F<T>::fact{1,1};
template<typename T>std::vector<T>F<T>::factinv{1,1};
template<typename T>std::vector<T>F<T>::inv{0,1};
template<typename T>
[[nodiscard]]std::vector<T>polynomial_talor_shift(const std::vector<T>&a,T c,int deg=-1){
  if(deg==-1)deg=a.size();
  std::vector<T>f(deg),g(deg);
  T now=1;
  int s=std::min(deg,(int)a.size());
  for(int i=0;i<s;i++){
    f[i]=a[i]*F<T>::factorial(i);
    g[deg-i-1]=now*F<T>::factorial_inv(i);
    now*=c;
  }
  f=ntt_convolution(f,g);
  std::vector<T>res(deg);
  for(int i=0;i<deg;i++)res[i]=f[i+deg-1]*F<T>::factorial_inv(i);
  return res;
}
template<typename T>
void transposed_dft(std::vector<T>&a){
  using value_type=typename T::value_type;
  using mul_type=typename T::mul_type;
  #ifdef NTT_SIMD
  if constexpr(std::numeric_limits<value_type>::digits<=32){
    if((int)a.size()>=32){
      transposed_dft_simd(a);
      return;
    }
  }
  #endif
  static constexpr ntt_root<T::mod()>r;
  int n=a.size();
  int h=lsb(n);
  int len=h;
  while(len){
    if(len==1){
      int p=1<<(h-1);
      for(int i=0;i<p;i++){
        T u=a[i],v=a[i+p];
        a[i]=u+v;
        a[i+p]=u-v;
      }
      len--;
    }
    else{
      int p=1<<(h-len);
      T rot=T::raw(1),imag=T::raw(r.root[2]);
      for(int s=0;s<(1<<(len-2));s++){
        const mul_type rot1=rot.val(),rot2=(rot*rot).val(),rot3=(rot*T::raw(rot2)).val();
        int of=s<<(h-len+2);
        for(int i=0;i<p;i++){
          const mul_type a0=a[i+of].val(),a1=a[i+of+p].val(),a2=a[i+of+p*2].val(),a3=a[i+of+p*3].val();
          const mul_type k=T((T::mod()+a2-a3)*imag.val()).val();
          a[i+of]=a0+a1+a2+a3;
          a[i+of+p]=(a0+T::mod()-a1+k)*rot1;
          a[i+of+p*2]=(a0+a1+T::mod()*2-a2-a3)*rot2;
          a[i+of+p*3]=(a0+T::mod()*2-a1-k)*rot3;
        }
        if(s+1!=1<<(len-2))rot*=T::raw(r.rate3[lsb(~(unsigned int)s)]);
      }
      len-=2;
    }
  }
}
template<typename T>
void transposed_idft(std::vector<T>&a){
  using value_type=typename T::value_type;
  using mul_type=typename T::mul_type;
  #ifdef NTT_SIMD
  if constexpr(std::numeric_limits<value_type>::digits<=32){
    if((int)a.size()>=32){
      transposed_idft_simd(a);
      return;
    }
  }
  #endif
  static constexpr ntt_root<T::mod()>r;
  static constexpr mul_type mod2=(mul_type)T::mod()*T::mod();
  int n=a.size();
  int h=lsb(n);
  int len=0;
  while(len<h){
    if(h-len==1){
      T rot=T::raw(1);
      for(int s=0;s<(1<<len);s++){
        int of=s*2;
        T u=a[of],v=a[of+1]*rot;
        a[of]=u+v;
        a[of+1]=u-v;
        if(s+1!=1<<len)rot*=T::raw(r.invrate2[lsb(~(unsigned int)s)]);
      }
      len++;
    }
    else{
      int p=1<<(h-len-2);
      T rot=T::raw(1),imag=T::raw(r.invroot[2]);
      for(int s=0;s<(1<<len);s++){
        const mul_type rot1=rot.val(),rot2=(rot*rot).val(),rot3=(rot*T::raw(rot2)).val();
        int of=s<<(h-len);
        for(int i=0;i<p;i++){
          const mul_type a0=a[i+of].val(),a1=(mul_type)a[i+of+p].val()*rot1,a2=(mul_type)a[i+of+p*2].val()*rot2,a3=(mul_type)a[i+of+p*3].val()*rot3;
          const mul_type m=(mul_type)T(a1+mod2-a3).val()*imag.val();
          const mul_type k=mod2-a2;
          a[i+of]=a0+a2+a1+a3;
          a[i+of+p]=a0+a2+(mod2*2-a1-a3);
          a[i+of+p*2]=a0+k+m;
          a[i+of+p*3]=a0+k+(mod2-m);
        }
        if(s+1!=1<<len)rot*=T::raw(r.invrate3[lsb(~(unsigned int)s)]);
      }
      len+=2;
    }
  }
}
template<typename T>
std::vector<T>transposed_ntt_convolution(std::vector<T>a,std::vector<T>b){
  assert(a.size()>=b.size());
  int n=a.size(),m=b.size();
  int s=ceil_pow2(n);
  T inv=T(s).inv();
  for(int i=0;i<n;i++)a[i]*=inv;
  a.resize(s),b.resize(s);
  transposed_idft(a);
  dft(b);
  for(int i=0;i<s;i++)a[i]*=b[i];
  transposed_dft(a);
  a.resize(n-m+1);
  return a;
}
template<typename T>
std::vector<T>fps_composition(std::vector<T>f,std::vector<T>g){
  assert(f.size()==g.size());
  const int n=ceil_pow2(f.size());
  T inv4=T(n*4).inv();
  std::vector<T>prep(n*4),preq(n*4);
  auto dfs=[&](auto self,int x,int y,std::vector<T>q)->std::vector<T> {
    if(x==1){
      std::vector<T>p(n*4);
      for(int i=0;i<std::ssize(f);i++){
        p[(n-i-1)*2]=f[i];
      }
      return p;
    }
    std::copy(q.begin(),q.begin()+n*2,preq.begin());
    dft(q);
    std::vector<T>q_memo(q);
    for(int i=0;i<n*2;i++){
      T l=q[i*2],r=q[i*2+1];
      q[i*2]*=r,q[i*2+1]*=l;
    }
    idft(q);
    for(int i=0;i<n*4;i++)q[i]*=inv4;
    for(int i=0;i<n*2;i+=2)q[n*2+i]+=preq[i]+preq[i];
    std::fill(preq.begin(),preq.end(),T());
    for(int j=0;j<y*2;j++)for(int i=0;i<x/2;i++){
      preq[j*x+i]=q[j*x*2+i*2];
    }
    std::swap(q,preq);
    std::vector<T>p=self(self,x>>1,y<<1,q);
    std::swap(p,prep);
    for(int j=y*2-1;j>=0;j--)for(int i=x/2-1;i>=0;i--){
      p[j*x*2+i*2+1]+=prep[j*x+i];
      prep[j*x+i]=T();
    }
    std::fill(prep.begin(),prep.end(),T());
    for(int i=n*2-1;i>=0;i--){
      prep[i]+=p[n*2+i];
    }
    for(int i=0;i<n*4;i++)p[i]*=inv4;
    transposed_idft(p);
    for(int i=0;i<n*2;i++){
      T l=q_memo[i*2],r=q_memo[i*2+1];
      p[i*2]*=r,p[i*2+1]*=l;
    }
    transposed_dft(p);
    for(int i=0;i<n*2;i++)p[i]+=prep[i];
    std::fill(prep.begin(),prep.begin()+n*2,T());
    return p;
  };
  if(g[0].val()){
    f=polynomial_talor_shift(f,g[0]);
    g[0]=T();
  }
  std::vector<T>q(n*4);
  for(int i=0;i<std::ssize(g);i++)q[i]=-g[i];
  std::vector<T>res=dfs(dfs,n,1,q);
  res.erase(res.begin(),res.begin()+n-std::ssize(f));
  res.resize(f.size());
  std::reverse(res.begin(),res.end());
  return res;
}
#include<optional>
constexpr std::pair<long long,long long>ext_gcd(long long a,long long b){
  if(b==0)return std::make_pair(1,0);
  auto [x,y]=ext_gcd(b,a%b);
  std::swap(x,y);
  return std::make_pair(x,y-a/b*x);
}
template<std::signed_integral T>
constexpr std::pair<T,T> inv_mod(T a,T b){
  a%=b;
  if(a<0)a+=b;
  if(a==0)return std::make_pair(b,0);
  T s=b,t=a;
  T m0=0,m1=1;
  while(t){
    T u=s/t;
    s-=t*u;
    m0-=m1*u;
    std::swap(s,t);
    std::swap(m0,m1);
  }
  if(m0<0)m0+=b/s;
  return std::make_pair(s,m0);
}
template<auto m>
struct modint{
  static_assert(1<=m&&m<(1ull<<63));
  using value_type=std::conditional_t<((m>>31)==0),uint32_t,uint64_t>;
  using mul_type=std::conditional_t<((m>>31)==0),uint64_t,__uint128_t>;
private:
  value_type v;
  static constexpr value_type umod=m;
  constexpr modint sqrt_impl()const{
    if(this->val()<=1)return *this;
    if(umod%8==1){
      modint b=2;
      while(b.pow((umod-1)/2).val()==1)b++;
      value_type m2=umod-1;
      int e=0;
      while(m2%2==0)m2>>=1,e++;
      modint x=this->pow((m2-1)/2);
      modint y=(*this)*x*x;
      x*=*this;
      modint z=b.pow(m2);
      while(y.val()!=1){
        int j=0;
        modint t=y;
        while(t.val()!=1)t*=t,j++;
        z=z.pow((value_type(1))<<(e-j-1));
        x*=z;
        z*=z;
        y*=z;
        e=j;
      }
      return x;
    }
    else if(umod%8==5){
      modint res=this->pow((umod+3)/8);
      if((res*res).val()==this->val())return res;
      else return res*modint(2).pow((umod-1)/4);
    }
    else return this->pow((umod+1)/4);
  }
  template<typename U,std::enable_if_t<std::unsigned_integral<U>||std::is_same_v<U,__uint128_t>,std::nullptr_t> =nullptr>
  static constexpr value_type take_mod(U x){
    if constexpr(std::numeric_limits<U>::max()<umod)return x;
    if constexpr(umod==(1ull<<61)-1){
      value_type res=(x>>61)+(x&umod);
      if(res>=umod)res-=umod;
      return res;
    }
    if constexpr(umod==(1ull<<61)-(1ull<<24)+1){
      static constexpr value_type mask=(1ull<<61)-1;
      value_type high=x>>61,low=x&mask;
      mul_type t=low+(mul_type(high)<<24)-high;
      high=t>>61,low=t&mask;
      low=low+(mul_type(high)<<24)-high;
      if(low>=umod)low-=umod;
      return low;
    }
    return x%umod;
  }
public:
  constexpr modint():v(0){}
  template<typename U,std::enable_if_t<std::signed_integral<U>||std::is_same_v<U,__int128_t>,std::nullptr_t> =nullptr>
  constexpr modint(U x){
    x%=std::make_signed_t<value_type>(umod);
    v=x>=0?x:x+umod;
  }
  template<typename U,std::enable_if_t<std::unsigned_integral<U>||std::is_same_v<U,__uint128_t>,std::nullptr_t> =nullptr>
  constexpr modint(U x):v(take_mod<U>(x)){}
  static constexpr value_type mod(){return umod;}
  template<typename U>
  static constexpr modint raw(U x){
    modint res;
    res.v=x;
    return res;
  }
  constexpr std::make_signed_t<value_type> val()const{return v;}
  constexpr modint &operator+=(const modint&b){
    this->v+=b.v;
    if(this->v>=umod)this->v-=umod;
    return *this;
  }
  constexpr modint &operator-=(const modint&b){
    this->v-=b.v;
    if(this->v>=umod)this->v+=umod;
    return *this;
  }
  constexpr modint &operator*=(const modint&b){
    this->v=take_mod(mul_type(this->v)*mul_type(b.v));
    return *this;
  }
  constexpr modint &operator/=(const modint&b){return *this*=b.inv();}
  constexpr modint operator+()const{return *this;}
  constexpr modint operator-()const{return modint()-*this;}
  friend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}
  friend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}
  friend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}
  friend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}
  constexpr auto operator<=>(const modint&)const=default;
  constexpr modint operator++(int){
    modint res=*this;
    this->v++;
    if(this->v==umod)this->v=0;
    return res;
  }
  constexpr modint operator--(int){
    modint res=*this;
    if(this->v==0)this->v=umod;
    this->v--;
    return res;
  }
  template<std::integral U>
  constexpr modint pow(U k)const{
    if constexpr(std::is_signed_v<U>){
      assert(0<=k);
    }
    modint res=1,a(*this);
    while(k){
      if(k&1)res*=a;
      a*=a;
      k>>=1;
    }
    return res;
  }
  constexpr modint inv()const{
    if constexpr(isprime_constexpr(umod)){
      if(std::is_constant_evaluated()){
        if(v==0){
          throw "no inverse";
        }
      }
      else assert(v!=0);
      return pow(umod-2);
    }
    else{
      modint res;
      auto [g,x]=inv_mod<std::make_signed_t<value_type>>(this->v,umod);
      if(std::is_constant_evaluated()){
        if(g!=1){
          throw "no inverse";
        }
      }
      else assert(g==1);
      res.v=x;
      return res;
    }
  }
  std::optional<modint>sqrt()const{
    if(this->val()<=1||this->pow((umod-1)/2)==1)return std::make_optional(this->sqrt_impl());
    else return std::nullopt;
  }
  friend std::istream &operator>>(std::istream&is,modint&b){
    long long a;
    is>>a;
    b=modint(a);
    return is;
  }
  friend std::ostream &operator<<(std::ostream&os,const modint&b){
    os<<b.val();
    return os;
  }
};
template<auto m>
struct std::hash<modint<m>>{
  std::size_t operator()(modint<m>x)const{
    return std::hash<typename modint<m>::value_type>(x.val());
  }
};
using mint998=modint<998244353>;
using mint107=modint<1000000007>;
using mint61=modint<2305843009213693951>;
using mint6124=modint<2305843009196916737>;
using mint=mint998;
void SOLVE(){
  int n,m;
  cin>>n>>m;
  vector<mint>f(n),g(n),h(n);
  cin>>f>>g>>h;
  mint v=f[1].pow(m);
  rep(i,n)g[i]*=v;
  auto ans=fps_composition(h,g);
  rep(i,n)cout<<ans[i]<<" \n"[i+1==n];
}