#ifdef INCLUDE_MAIN ATT inline void Solve() { CIN( int , N , M ); if( N == 0 ){ RETURN( "0 1" ); } const MP& zero = PO::c_zero(); const MP& one = PO::c_one(); const MP two = one + one; FPS x{ 3 * N + 2 , PO( 1 , one ) }; FPS R{ 3 * N + 1 }; FOR( i , 0 , M ){ cin >> R[i]; } R /= x * x - one; R = Integral( R ); FPS eR{ Exp( R ) }; FPS G{ 2 * N + 2 , eR * x }; Shift( G , one ); assert( G.SZ() <= 2 * N + 2 ); G = MoeviusComposition( 3 * N + 2 , G , -two , zero , one , one ); assert( G.SZ() <= 3 * N + 2 ); FOR( i , 0 , 3 * N + 2 ){ G[i] *= MP::DeRP( i * 2 ) ^ N; } G = MoeviusComposition( 3 * N + 2 , G , -one , zero , one , two ); assert( G.SZ() <= 3 * N + 2 ); Shift( G , -one ); assert( G.SZ() <= 3 * N + 2 ); G /= eR; FOREQ( i , 0 , N + 1 ){ cout << G[i] << " \n"[i==N+1]; } } REPEAT_MAIN(1); #else // INCLUDE_MAIN #ifdef INCLUDE_SUB inline void Experiment() {} inline void SmallTest() {} #define INCLUDE_MAIN #include __FILE__ #else // INCLUDE_SUB #ifdef INCLUDE_LIBRARY // VVV 常設でないライブラリは以下に挿入する。 #define PO Polynomial #define FPS FormalPowerSeries #ifdef DEBUG #include "c:/Users/user/Documents/Programming/Mathematics/Polynomial/FPS/a_Body.hpp" #else // 先にConstexprModuloを貼る。 ST_AS( is_same_v> ); TE CE INT Log(INT N){INT AN = 0,pw = 1;WH(N > pw){pw <<= 1;AN++;}RE AN;} TE CL Power3Power_CE{PU:T m_val[EX_lim];CE Power3Power_CE(CO T& t);CE CO T& OP[](CRI i)CO;CE CO T(&Get()CO)[EX_lim];}; TE CE Power3Power_CE::Power3Power_CE(CO T& t):m_val(){T pw{t};for(uint EX = EX_lim - 1;EX + 1 > 0;EX--){m_val[EX]= -pw;m_val[EX]*= pw *= pw;}}TE CE CO T& Power3Power_CE::OP[](CRI i)CO{AS(i < EX_lim);RE m_val[i];}TE CE CO T(&Power3Power_CE::Get()CO)[EX_lim]{RE m_val;} // PO #define DC_OF_AR_FOR_PO(FUNC)IN PO OP FUNC(PO f)CO;IN PO OP FUNC(T t)CO #define DF_OF_AR_FOR_PO(FUNC,DEF)TE IN PO PO::OP FUNC(PO f)CO{RE MO(DEF);};TE IN PO PO::OP FUNC(T t)CO{RE *TH FUNC PO(MO(t));} TE CL PO{PU:VE m_f;int m_SZ;IN PO();IN PO(CO PO& f);IN PO(PO&& f);IN PO(VE f);IN PO(T t);IN PO(CRI i,T t);IN PO& OP=(T n);IN PO& OP=(PO f);IN PO& OP=(VE f);IN CO T& OP[](CRI i)CO;IN T& OP[](CRI i);T OP()(CO T& t)CO;PO& OP+=(CO PO& f);PO& OP-=(CO PO& f);PO& OP*=(PO f);IN PO& OP/=(CO PO& f);PO& OP/=(CO T& t);PO& OP%=(CO PO& f);PO& OP%=(CO T& t);bool OP==(CO PO& f)CO;bool OP==(CO T& t)CO;TE IN bool OP!=(CO P& f)CO;DC_OF_AR_FOR_PO(+);IN PO OP-()CO;DC_OF_AR_FOR_PO(-);DC_OF_AR_FOR_PO(*);IN PO OP/(CO PO& f)CO;IN PO OP/(CO T& t)CO;IN PO OP%(CO PO& f)CO;IN PO OP%(CO T& t)CO;IN CO VE& GetCoefficient()CO NE;IN CRI SZ()CO NE;IN VO resize(CRI deg_plus)NE;int Valuation()CO NE;IN VO swap(PO& f);IN VO swap(VE& f);VO Reduce();VO TP(CRI N_trunc);ST PO NaiveCN(PO f0,CRI valuation0,CO PO& f1,CRI valuation1,CRI N_trunc);ST PO NaiveQuotient(PO f0,CO PO& f1);ST PO NaiveResidue(PO f0,CO PO& f1);ST IN CO PO& zero();ST IN CO PO& one();ST IN CO PO& x();ST IN CO T& c_zero();ST IN CO T& c_one();ST IN CO T& c_minus_one();IN PO& SignInvert();}; // FPS TE CL FPS:PU PO{PU:int m_N;IN FPS(CRI N = 0);IN FPS(CO FPS& f);IN FPS(FPS&& f);IN FPS(CRI N,T t);IN FPS(CRI N,CO PO& f);IN FPS(CRI N,PO&& f);IN FPS(CRI N,VE&& f);IN FPS(CRI N,CRI i,T t);IN FPS& OP=(FPS f);IN FPS& OP=(T n);IN FPS& OP=(PO f);IN FPS& OP+=(CO T& t);FPS& OP+=(CO PO& f);IN FPS& OP+=(CO FPS& f);IN FPS& OP-=(CO T& t);FPS& OP-=(CO PO& f);IN FPS& OP-=(CO FPS& f);IN FPS& OP*=(CO T& t);FPS& OP*=(PO f);IN FPS& OP*=(FPS f);IN FPS& OP/=(CO T& t);IN FPS& OP/=(CO FPS& t);TE IN FPS OP+(CO P& f)CO;IN FPS OP-()CO;TE IN FPS OP-(CO P& f)CO;TE IN FPS OP*(CO P& f)CO;TE IN FPS OP/(CO P& f)CO;FPS Inverse()CO;IN VO SetTruncation(CRI N)NE;IN CRI GetTruncation()CO NE;IN FPS& TruncateInitial(CRI N)NE;IN FPS& TruncateFinal(CRI N)NE;}; TE US FPS = FPS; // FFT #define PS_FOR_FFT_BODY(MOD,LE,PR,IPR,TYPE)ST_AS((TYPE::DeRP(PR)*= TYPE::DeRP(IPR))== TYPE::DeRP(1));TE <> CE CO uint LimitOfPowerForFFT = LE - 1;TE <> IN CO TYPE(&PrimitiveRootOfTwoForFFT()NE)[LimitOfPowerForFFT]{ST CE Power3Power_CE> PRT{PR};ST_AS(PRT.m_val[0]== TYPE::DeRP(1));RE PRT.Get();}TE <> IN CO TYPE(&InversePrimitiveRootOfTwoForFFT()NE)[LimitOfPowerForFFT]{ST CE Power3Power_CE> IPRT{IPR};ST_AS(IPRT.m_val[0]== TYPE::DeRP(1)&&(TYPE::DeRP(PR)*= TYPE::DeRP(IPR))== TYPE::DeRP(1));RE IPRT.Get();}TE <> IN PO& PO::OP*=(PO f){CO int SZ = m_SZ + f.m_SZ - 1;RE *TH = FFTCN(MO(*TH),MO(f),SZ);}TE <> IN PO& PO::OP/=(CO PO& f){RE *TH = FFTQuotient(*TH,f);}TE <> IN PO& PO::OP%=(CO PO& f){RE *TH = FFTResidue(*TH,f);} #define PS_FOR_FFT(MOD,LE,PR,IPR,MINT)PS_FOR_FFT_BODY(MOD,LE,PR,IPR,MINT) TE CE CO int LimitOfPowerForFFT;TE IN CO T(&PrimitiveRootOfTwoForFFT()NE)[LimitOfPowerForFFT];TE IN CO T(&InversePrimitiveRootOfTwoForFFT()NE)[LimitOfPowerForFFT]; TE VO CooleyTukey(VE& f,CRI N_shift,CRI N_input_start,CRI N_input_lim,CRI N_trunc,CRI two_pw,CRI EX,CO T(&PRT)[LimitOfPowerForFFT]){AS(N_input_lim - N_input_start <= two_pw);CO int N_zero = N_shift + N_input_start,le = N_zero + two_pw;AS(N_zero <= N_trunc && int(f.SZ()) <= le);CO int N_input_final = min(N_input_start + two_pw,int(f.SZ()));for(int i = N_input_lim;i < N_input_final;i++){f[i]= T{};}WH(int(f.SZ())< le){f.push_back(T{});}ST VE bit_reverse[32]={VE(1)};ST int e_next = 1;ST int two_pw_next = 1;ST int two_pw_next2 = 2;ST VE* p_bit_reverse_prev = bit_reverse;ST VE* p_bit_reverse_curr = p_bit_reverse_prev + 1;WH(e_next <= EX){*p_bit_reverse_curr = VE(two_pw_next2);int* p_bit_reverse_curr_i = &((*p_bit_reverse_curr)[0]);int* p_bit_reverse_curr_i_plus = p_bit_reverse_curr_i + two_pw_next;int* p_bit_reverse_prev_i = &((*p_bit_reverse_prev)[0]);for(int i = 0;i < two_pw_next;i++){(*(p_bit_reverse_curr_i_plus++)= *(p_bit_reverse_curr_i++)= *(p_bit_reverse_prev_i++)* 2)+= 1;}e_next++;swap(two_pw_next,two_pw_next2);two_pw_next2 *= 4;p_bit_reverse_prev++;p_bit_reverse_curr++;}CO VE& bit_reverse_EX = bit_reverse[EX];int bit_num = 0;CO int* p_bit_num_reverse = &(bit_reverse_EX[bit_num]);WH(bit_num < two_pw){if(*p_bit_num_reverse < bit_num){swap(f[*p_bit_num_reverse + N_input_start],f[bit_num + N_input_start]);}bit_num++;p_bit_num_reverse++;}CO T& one = PRT[0];T zeta,diff;int i,j,j_lim,two_pw_curr = 1,two_pw_curr_2 = 2;WH(two_pw_curr < two_pw){CO int N_input_final_curr = N_input_start + two_pw_curr;bit_num = 0;i = 0;zeta = one;WH(i < two_pw){j = i;j_lim = i + two_pw_curr;WH(j < j_lim){diff = f[j + N_input_start]- f[j + N_input_final_curr];f[j + N_input_start]+= f[j + N_input_final_curr];f[j + N_input_final_curr]= zeta * diff;j++;}bit_num++;i += two_pw_curr_2;j = 0;WH(true){if(((bit_num >> j)& 1)== 1){zeta *= PRT[j+1];break;}j++;}}two_pw_curr <<= 1;two_pw_curr_2 <<= 1;}if(N_trunc < le){f.resize(N_trunc);}if(N_shift > 0){for(int i = min(le,N_trunc)- 1;i >= N_zero;i--){f[i]= MO(f[i - N_shift]);}for(int i = min(le,N_zero)- 1;i >= N_input_start;i--){f[i]= T{};}}RE;}TE IN VO FFT(VE& f,CRI N_input_start,CRI N_input_lim,CRI two_pw,CRI EX){CooleyTukey(f,0,N_input_start,N_input_lim,N_input_start + two_pw,two_pw,EX,PrimitiveRootOfTwoForFFT());}TE IN VO IFFT(VE& f,CRI N_shift,CRI N_input_start,CRI N_input_lim,CRI N_trunc,CRI two_pw,CO T& two_pw_inv,CRI EX){CooleyTukey(f,N_shift,N_input_start,N_input_lim,N_trunc,two_pw,EX,InversePrimitiveRootOfTwoForFFT());CO int SZ = f.SZ();for(int i = N_shift + N_input_start;i < SZ;i++){f[i]*= two_pw_inv;}}TE PO FFTCN(PO f0,PO f1,CRI N_trunc){f0.Reduce();if(f0.m_SZ == 0){RE MO(f0);}f1.Reduce();if(f1.m_SZ == 0){RE MO(f1);}AS(f0.m_SZ <= N_trunc);CO int valuation0 = f0.Valuation();CO int valuation1 = f1.Valuation();if(N_trunc <= valuation0 + valuation1){RE f0.zero();}CO int le0 = f0.m_SZ - valuation0;CO int le1 = min(f1.m_SZ,N_trunc)- valuation1;CO int le = le0 + le1 - 1;CO int EX = Log(le);if(min(le0,le1)<= EX){RE f0.NaiveCN(MO(f0),valuation0,MO(f1),valuation1,min(f0.m_SZ + f1.m_SZ - 1,N_trunc));}CO int two_pw = 1 << EX;FFT(f0.m_f,valuation0,f0.m_SZ,two_pw,EX);FFT(f1.m_f,valuation1,valuation1 + le1,two_pw,EX);for(int i = 0;i < two_pw;i++){f0.m_f[i + valuation0]*= f1.m_f[i + valuation1];}IFFT(f0.m_f,valuation1,valuation0,valuation0 + two_pw,N_trunc,two_pw,f0.c_one()/ two_pw,EX);f0.m_SZ = f0.m_f.SZ();RE MO(f0);}TE PO FFTQuotient(PO& f0,PO f1){f0.Reduce();f1.Reduce();AS(f1.m_SZ > 0);if(f0.m_SZ < f1.m_SZ){RE PO::zero();}CO int f0_TP_SZ = f0.m_SZ - f1.m_SZ + 1;CO int f1_TP_SZ = min(f0_TP_SZ,f1.m_SZ);f1.TP(f1_TP_SZ);CO FPS f1_TP_inverse = FPS(f0_TP_SZ,MO(f1)).Inverse();f0.TP(f0_TP_SZ);FPS f0_TP{f0_TP_SZ,MO(f0)};f0_TP *= f1_TP_inverse;f0_TP.TP(f0_TP_SZ);RE f0_TP;}TE PO FFTResidue(PO& f0,PO f1){f0.Reduce();f1.Reduce();AS(f1.m_SZ > 0);if(f0.m_SZ >= f1.m_SZ){f0 -=(f0 / f1)* f1;f0.Reduce();}RE MO(f0);} PS_FOR_FFT(P,24,31,128805723,Mod); PS_FOR_FFT(167772161,26,17,29606852,Mod); PS_FOR_FFT(469762049,27,30,15658735,Mod); PS_FOR_FFT(754974721,25,362,415027540,Mod); // FPS TE IN FPS::FPS(CRI N):PO(),m_N(N){}TE IN FPS::FPS(CO FPS& f):PO(f),m_N(f.m_N){}TE IN FPS::FPS(FPS&& f):PO(MO(f.m_f)),m_N(f.m_N){}TE IN FPS::FPS(CRI N,T t):PO(MO(t)),m_N(N){AS(m_N > 0);}TE IN FPS::FPS(CRI N,CO PO& f):PO(),m_N(N){AS(m_N > 0);TH->m_SZ = f.m_SZ < m_N?f.m_SZ:m_N;TH->m_f = VE(TH->m_SZ);for(int i = 0;i < TH->m_SZ;i++){TH->m_f[i]= f.m_f[i];}}TE IN FPS::FPS(CRI N,PO&& f):PO(),m_N(N){if(f.m_SZ < m_N * 2){PO::OP=(MO(f));if(f.m_SZ > m_N){TruncateFinal(m_N);}}else{TH->m_f = VE(m_N);for(int i = 0;i < m_N;i++){TH->m_f[i]= MO(f.m_f[i]);}TH->m_SZ = m_N;}}TE IN FPS::FPS(CRI N,VE&& f):PO(),m_N(N){AS(m_N > 0);CO int f_SZ = f.SZ();if(f_SZ < m_N * 2){PO::OP=(MO(f));if(f_SZ > m_N){TruncateFinal(m_N);}}else{TH->m_f = VE(m_N);for(int i = 0;i < m_N;i++){TH->m_f[i]= MO(f[i]);}}}TE IN FPS::FPS(CRI N,CRI i,T t):PO(),m_N(N){AS(m_N > 0);if(i < m_N?t != TH->c_zero():false){(*TH)[i]= MO(t);}}TE IN FPS& FPS::OP=(FPS f){PO::OP=(MO(f.m_f));m_N = f.m_N;RE *TH;}TE IN FPS& FPS::OP=(T n){PO::OP=(MO(n));RE *TH;}TE IN FPS& FPS::OP=(PO f){RE OP=(FPS(m_N,MO(f)));}TE IN FPS& FPS::OP+=(CO T& t){PO::OP+=(t);RE *TH;}TE FPS& FPS::OP+=(CO PO& f){CRI SZ_f = m_N < f.m_SZ?m_N:f.m_SZ;CRI SZ = TH->m_SZ < SZ_f?TH->m_SZ:SZ_f;for(int i = 0;i < SZ;i++){TH->m_f[i]+= f.m_f[i];}for(int i = SZ;i < SZ_f;i++){TH->m_f.push_back(f.m_f[i]);}TH->m_SZ = TH->m_f.SZ();RE *TH;}TE IN FPS& FPS::OP+=(CO FPS& f){AS(m_N <= f.m_N);CO PO& f_ref = f;RE OP+=(f_ref);}TE IN FPS& FPS::OP-=(CO T& t){PO::OP-=(t);RE *TH;}TE FPS& FPS::OP-=(CO PO& f){CRI SZ_f = m_N < f.m_SZ?m_N:f.m_SZ;CRI SZ = TH->m_SZ < SZ_f?TH->m_SZ:SZ_f;for(int i = 0;i < SZ;i++){TH->m_f[i]-= f.m_f[i];}for(int i = SZ;i < SZ_f;i++){TH->m_f.push_back(-f.m_f[i]);}TH->m_SZ = TH->m_f.SZ();RE *TH;}TE IN FPS& FPS::OP-=(CO FPS& f){AS(m_N <= f.m_N);CO PO& f_ref = f;RE OP-=(f_ref);}TE IN FPS& FPS::OP*=(CO T& t){PO::OP*=(t);RE *TH;}TE FPS& FPS::OP*=(PO f){*TH = FFTCN(forward>(*TH),MO(f),m_N);RE *TH;}TE IN FPS& FPS::OP*=(FPS f){AS(m_N <= f.m_N);RE OP*=(forward>(f));}TE IN FPS& FPS::OP/=(CO T& t){PO::OP/=(t);RE *TH;}TE IN FPS& FPS::OP/=(CO FPS& f){AS(m_N <= f.m_N);RE OP*=(m_N == f.m_N?f.Inverse():FPS(m_N,f).Inverse());}TE TE IN FPS FPS::OP+(CO P& f)CO{RE MO(FPS(*TH)+= f);}TE IN FPS FPS::OP-()CO{RE MO(FPS(m_N)-= *TH);}TE TE IN FPS FPS::OP-(CO P& f)CO{RE MO(FPS(*TH)-= f);}TE TE IN FPS FPS::OP*(CO P& f)CO{RE MO(FPS(*TH)*= f);}TE TE IN FPS FPS::OP/(CO P& f)CO{RE MO(FPS(*TH)/= f);}TE FPS FPS::Inverse()CO{AS(TH->m_SZ > 0 && TH->m_f[0]!= TH->c_zero());CO PO& TH_ref = *TH;int pw;int pw_2 = 1;FPS f_inv{pw_2,TH->c_one()/ TH->m_f[0]};WH(pw_2 < m_N){pw = pw_2;pw_2 <<= 1;f_inv.SetTruncation(pw_2);auto temp = f_inv * TH_ref;temp[0]--;temp *= f_inv;for(int i = pw;i < pw_2;i++){f_inv[i]-= temp[i];}}f_inv.SetTruncation(m_N);RE f_inv;}TE IN VO FPS::SetTruncation(CRI N)NE{if(N < m_N){TruncateFinal(N);}m_N = N;}TE IN CRI FPS::GetTruncation()CO NE{RE m_N;}TE IN FPS& FPS::TruncateInitial(CRI N)NE{CRI SZ = N < TH->m_SZ?N:TH->m_SZ;for(int i = 0;i < SZ;i++){TH->m_f[i]= 0;}RE *TH;}TE IN FPS& FPS::TruncateFinal(CRI N)NE{WH(TH->m_SZ > N){TH->m_f.pop_back();TH->m_SZ--;}RE *TH;}TE FPS Differential(CO FPS& f){auto& SZ = f.SZ();auto& N = f.GetTruncation();if(SZ < 1){RE FPS(1 < N?N - 1:1);}VE df(SZ - 1);for(int i = 1;i < SZ;i++){df[i - 1]= f[i]* i;}RE FPS(1 < N?N - 1:1,MO(df));}TE FPS Differential(CRI n,CO FPS& f){if(n == 0){RE f;}if(n == 1){RE Differential(f);}auto& SZ = f.SZ();auto& N = f.GetTruncation();if(SZ < n){RE FPS(n < N?N - n:1);}VE df(SZ - n);T coef = T::Factorial(n),numer = n,denom = 0;for(int i = n;i < SZ;i++){df[i - n]= f[i]* coef;(coef *= ++numer)/= ++denom;}RE FPS(n < N?N - n:1,MO(df));}TE FPS ShiftedIntegral(CRI n,CO FPS& f,CRI shift){auto& SZ = f.SZ();auto& N = f.GetTruncation();if(SZ + n < shift){RE FPS{N + n > shift?N + n - shift:1};}VE F(SZ + n - shift);if(n == 0){for(int i = shift;i < SZ;i++){F[i - shift]= f[i];}}else if(n == 1){CO int i_min = max(shift - 1,0);T denom = i_min;for(int i = i_min;i < SZ;i++){F[i + 1 - shift]= f[i]/ ++denom;}}else{CO int i_min = max(shift - n,0);for(int i = i_min;i < SZ;i++){F[i + n - shift]= f[i]* T::Factorial(i)* T::FactorialInverse(n + i);}}RE FPS(N + n - shift,MO(F));}TE IN FPS Integral(CO FPS& f){RE ShiftedIntegral(1,f,0);}TE IN FPS Integral(CRI n,CO FPS& f){RE ShiftedIntegral(n,f,0);}TE FPS Exp(CO FPS& f){AS(f[0]== f.c_zero());CRI N = f.GetTruncation();int pw;int pw_2 = 1;FPS f_exp{pw_2,f.c_one()};WH(pw_2 < N){pw = pw_2;pw_2 *= 2;f_exp.SetTruncation(pw_2);auto temp = Differential(f_exp);temp /= f_exp;temp = ShiftedIntegral(1,temp,pw);for(int i = 0;i < pw;i++){temp[i]-= f[i | pw];}temp *= f_exp;for(int i = 0;i < pw;i++){f_exp[i|pw]-= temp[i];}}f_exp.SetTruncation(N);RE f_exp;}TE IN FPS Log(CO FPS& f){AS(f[0]== f.c_one());RE Integral(Differential(f)/= f);}TE IN OS& OP<<(OS& os,CO FPS& f){CO int N = f.GetTruncation();for(int i = 0;i < N;i++){(i > 0?os << " ":os)<< f[i];}RE os;} // PO TE IN PO::PO():m_f(),m_SZ(0){}TE IN PO::PO(CO PO& f):m_f(f.m_f),m_SZ(f.m_SZ){}TE IN PO::PO(PO&& f):m_f(MO(f.m_f)),m_SZ(f.m_SZ){}TE IN PO::PO(VE f):m_f(MO(f)),m_SZ(m_f.SZ()){}TE IN PO::PO(T t):PO(){if(t != c_zero()){OP[](0)= MO(t);}}TE IN PO::PO(CRI i,T t):PO(){if(t != c_zero()){OP[](i)= MO(t);}}TE IN PO& PO::OP=(T n){m_f.clear();m_SZ = 0;OP[](0)= MO(n);RE *TH;}TE IN PO& PO::OP=(PO f){m_f = MO(f.m_f);m_SZ = f.m_SZ;RE *TH;}TE IN PO& PO::OP=(VE f){m_f = MO(f);m_SZ = m_f.SZ();RE *TH;}TE IN CO T& PO::OP[](CRI i)CO{RE m_SZ <= i?c_zero():m_f[i];}TE IN T& PO::OP[](CRI i){if(m_SZ <= i){CO T& z = c_zero();WH(m_SZ <= i){m_f.push_back(z);m_SZ++;}}RE m_f[i];}TE T PO::OP()(CO T& t)CO{T AN =(*TH)[0];T t_pw = c_one();for(int d = 1;d < m_SZ;d++){AN += m_f[d]*(t_pw *= t);}RE AN;}TE PO& PO::OP+=(CO PO& f){if(m_SZ < f.m_SZ){for(int i = 0;i < m_SZ;i++){m_f[i]+= f.m_f[i];}for(int i = m_SZ;i < f.m_SZ;i++){m_f.push_back(f.m_f[i]);}m_SZ = f.m_SZ;}else{for(int i = 0;i < f.m_SZ;i++){m_f[i]+= f.m_f[i];}}RE *TH;}TE PO& PO::OP-=(CO PO& f){if(m_SZ < f.m_SZ){for(int i = 0;i < m_SZ;i++){m_f[i]-= f.m_f[i];}for(int i = m_SZ;i < f.m_SZ;i++){m_f.push_back(- f.m_f[i]);}m_SZ = f.m_SZ;}else{for(int i = 0;i < f.m_SZ;i++){m_f[i]-= f.m_f[i];}}RE *TH;}TE PO& PO::OP/=(CO T& t){if(t == c_one()){RE *TH;}CO T t_inv{c_one()/ t};for(int i = 0;i < m_SZ;i++){OP[](i)*= t_inv;}RE *TH;}TE PO& PO::OP%=(CO T& t){if(t == c_one()){RE *TH = zero();}for(int i = 0;i < m_SZ;i++){m_f[i]%= t;}RE *TH;}TE bool PO::OP==(CO PO& f)CO{CRI SZ0 = SZ();CRI SZ1 = f.SZ();CRI SZ_max = SZ0 < SZ1?SZ1:SZ0;for(int i = 0;i < SZ_max;i++){if(OP[](i)!= f[i]){RE false;}}RE true;}TE bool PO::OP==(CO T& t)CO{CRI SZ_max = SZ();CO T& zero = PO::c_zero();for(int i = 1;i < SZ_max;i++){if(m_f[i]!= zero){RE false;}}RE OP[](0)== t;}TE TE IN bool PO