結果
| 問題 | No.1618 Convolution? |
| ユーザー |
 to-omer
|
| 提出日時 | 2021-07-22 21:38:43 |
| 言語 | Rust (1.77.0) |
| 結果 |
AC
|
| 実行時間 | 295 ms / 2,000 ms |
| コード長 | 45,612 bytes |
| コンパイル時間 | 3,870 ms |
| コンパイル使用メモリ | 197,096 KB |
| 実行使用メモリ | 26,148 KB |
| 最終ジャッジ日時 | 2023-09-24 16:06:12 |
| 合計ジャッジ時間 | 11,511 ms |
|
ジャッジサーバーID （参考情報） |
judge14 / judge12 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
4,380 KB |
| testcase_01 | AC | 1 ms
4,380 KB |
| testcase_02 | AC | 274 ms
21,168 KB |
| testcase_03 | AC | 280 ms
22,460 KB |
| testcase_04 | AC | 150 ms
15,100 KB |
| testcase_05 | AC | 16 ms
4,376 KB |
| testcase_06 | AC | 285 ms
24,784 KB |
| testcase_07 | AC | 285 ms
24,676 KB |
| testcase_08 | AC | 150 ms
15,140 KB |
| testcase_09 | AC | 294 ms
26,052 KB |
| testcase_10 | AC | 275 ms
19,408 KB |
| testcase_11 | AC | 289 ms
25,520 KB |
| testcase_12 | AC | 294 ms
25,988 KB |
| testcase_13 | AC | 293 ms
26,080 KB |
| testcase_14 | AC | 291 ms
26,040 KB |
| testcase_15 | AC | 293 ms
26,136 KB |
| testcase_16 | AC | 295 ms
26,148 KB |
ソースコード
pub fn main() {
crate::prepare!();
sc!(n, a: [i32; n], b: [i32; n]);
let mut ca = convolve2(&a, &(1..=n as i32).collect::<Vec<_>>());
let cb = convolve2(&b, &(1..=n as i32).collect::<Vec<_>>());
for (a, b) in ca.iter_mut().zip(cb.iter()) {
*a += b;
}
pp!(0, @iter ca);
}
#[allow(unused_imports)]use std::{cmp::{Ordering,Reverse},collections::{BTreeMap,BTreeSet,BinaryHeap,HashMap,HashSet,VecDeque}};
mod main_macros{#[doc=" Prepare useful macros."]#[doc=" - `prepare!();`: default (all input scanner (`sc!`, `sv!`) + buf print (`pp!`))"]#[doc=" - `prepare!(?);`: interactive (line scanner (`scln!`) + buf print (`pp!`))"]#[macro_export]macro_rules!prepare{(@normal($dol:tt))=>{#[allow(unused_imports)]use std::io::Write as _;let __out=std::io::stdout();#[allow(unused_mut,unused_variables)]let mut __out=std::io::BufWriter::new(__out.lock());#[allow(unused_macros)]macro_rules!pp{($dol($dol t:tt)*)=>{$dol crate::iter_print!(__out,$dol($dol t)*)}}let __in_buf=read_stdin_all_unchecked();#[allow(unused_mut,unused_variables)]let mut __scanner=Scanner::new(&__in_buf);#[allow(unused_macros)]macro_rules!sc{($dol($dol t:tt)*)=>{$dol crate::scan!(__scanner,$dol($dol t)*)}}#[allow(unused_macros)]macro_rules!sv{($dol($dol t:tt)*)=>{$dol crate::scan_value!(__scanner,$dol($dol t)*)}}};(@interactive($dol:tt))=>{#[allow(unused_imports)]use std::io::Write as _;let __out=std::io::stdout();#[allow(unused_mut,unused_variables)]let mut __out=std::io::BufWriter::new(__out.lock());#[allow(unused_macros)]#[doc=" - to flush: `pp!(@flush);`"]macro_rules!pp{($dol($dol t:tt)*)=>{$dol crate::iter_print!(__out,$dol($dol t)*)}}#[allow(unused_macros)]#[doc=" Scan a line, and previous line will be truncated in the next call."]macro_rules!scln{($dol($dol t:tt)*)=>{let __in_buf=read_stdin_line();#[allow(unused_mut,unused_variables)]let mut __scanner=Scanner::new(&__in_buf);$dol crate::scan!(__scanner,$dol($dol t)*)}}};()=>{$crate::prepare!(@normal($))};(?)=>{$crate::prepare!(@interactive($))};}}
mod iter_print{use std::{fmt::Display,io::{Error,Write}};pub trait IterPrint{fn iter_print<W,S>(self,writer:&mut W,sep:S,is_head:bool)->Result<(),Error>where W:Write,S:Display;}macro_rules!iter_print_tuple_impl{(@impl$($A:ident$a:ident)?,$($B:ident$b:ident)*)=>{impl<$($A,)?$($B),*>IterPrint for($($A,)?$($B),*)where$($A:Display,)?$($B:Display),*{#[allow(unused_variables)]fn iter_print<W,S>(self,writer:&mut W,sep:S,is_head:bool)->Result<(),Error>where W:Write,S:Display{let($($a,)?$($b,)*)=self;$(if is_head{::std::write!(writer,"{}",$a)?;}else{::std::write!(writer,"{}{}",sep,$a)?;})?$(::std::write!(writer,"{}{}",sep,$b)?;)*Ok(())}}};(@inc,,$C:ident$c:ident$($D:ident$d:ident)*)=>{iter_print_tuple_impl!(@impl,);iter_print_tuple_impl!(@inc$C$c,,$($D$d)*);};(@inc$A:ident$a:ident,$($B:ident$b:ident)*,$C:ident$c:ident$($D:ident$d:ident)*)=>{iter_print_tuple_impl!(@impl$A$a,$($B$b)*);iter_print_tuple_impl!(@inc$A$a,$($B$b)*$C$c,$($D$d)*);};(@inc$A:ident$a:ident,$($B:ident$b:ident)*,)=>{iter_print_tuple_impl!(@impl$A$a,$($B$b)*);};($($t:tt)*)=>{iter_print_tuple_impl!(@inc,,$($t)*);};}iter_print_tuple_impl!(A a B b C c D d E e F f G g H h I i J j K k);#[doc=" Print expressions with a separator."]#[doc=" - `iter_print!(writer, args...)`"]#[doc=" - `@sep $expr,`: set separator (default: `' '`)"]#[doc=" - `@fmt $lit => {$($expr),*}`: print `format!($lit, $($expr),*)`"]#[doc=" - `@flush`: flush writer"]#[doc=" - `@iter $expr`: print iterator"]#[doc=" - `@tuple $expr`: print tuple (need to import [`IterPrint`], each elements impls `Display`)"]#[doc=" - `$expr`: print expr"]#[doc=" - `;`: println"]#[doc=""]#[doc=" [`IterPrint`]: IterPrint"]#[macro_export]macro_rules!iter_print{(@@fmt$writer:expr,$sep:expr,$is_head:expr,$lit:literal,$($e:expr),*)=>{if!$is_head{::std::write!($writer,"{}",$sep).expect("io error");}::std::write!($writer,$lit,$($e),*).expect("io error");};(@@item$writer:expr,$sep:expr,$is_head:expr,$e:expr)=>{$crate::iter_print!(@@fmt$writer,$sep,$is_head,"{}",$e);};(@@line_feed$writer:expr$(,)?)=>{::std::writeln!($writer).expect("io error");};(@@iter$writer:expr,$sep:expr,$is_head:expr,$iter:expr)=>{{let mut iter=$iter.into_iter();if let Some(item)=iter.next(){$crate::iter_print!(@@item$writer,$sep,$is_head,item);}for item in iter{$crate::iter_print!(@@item$writer,$sep,false,item);}}};(@@iterns$writer:expr,$sep:expr,$is_head:expr,$iter:expr)=>{{let mut iter=$iter.into_iter();if let Some(item)=iter.next(){$crate::iter_print!(@@item$writer,$sep,$is_head,item);}for item in iter{$crate::iter_print!(@@item$writer,$sep,true,item);}}};(@@tuple$writer:expr,$sep:expr,$is_head:expr,$tuple:expr)=>{IterPrint::iter_print($tuple,&mut$writer,$sep,$is_head).expect("io error");};(@@assert_tag item)=>{};(@@assert_tag iter)=>{};(@@assert_tag iterns)=>{};(@@assert_tag tuple)=>{};(@@assert_tag$tag:ident)=>{::std::compile_error!(::std::concat!("invalid tag in `iter_print!`: `",std::stringify!($tag),"`"));};(@@inner$writer:expr,$sep:expr,$is_head:expr,@sep$e:expr,$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,$e,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@flush$($t:tt)*)=>{$writer.flush().expect("io error");$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@fmt$lit:literal=>{$($e:expr),*$(,)?}$($t:tt)*)=>{$crate::iter_print!(@@fmt$writer,$sep,$is_head,$lit,$($e),*);$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$e:expr,$($t:tt)*)=>{$crate::iter_print!(@@assert_tag$tag);$crate::iter_print!(@@$tag$writer,$sep,$is_head,$e);$crate::iter_print!(@@inner$writer,$sep,false,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$e:expr;$($t:tt)*)=>{$crate::iter_print!(@@assert_tag$tag);$crate::iter_print!(@@$tag$writer,$sep,$is_head,$e);$crate::iter_print!(@@line_feed$writer);$crate::iter_print!(@@inner$writer,$sep,true,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$e:expr)=>{$crate::iter_print!(@@assert_tag$tag);$crate::iter_print!(@@$tag$writer,$sep,$is_head,$e);$crate::iter_print!(@@inner$writer,$sep,false,);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$($t:tt)*)=>{::std::compile_error!(::std::concat!("invalid expr in `iter_print!`: `",std::stringify!($($t)*),"`"));};(@@inner$writer:expr,$sep:expr,$is_head:expr,,$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,;$($t:tt)*)=>{$crate::iter_print!(@@line_feed$writer);$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,)=>{$crate::iter_print!(@@line_feed$writer);};(@@inner$writer:expr,$sep:expr,$is_head:expr,$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,$sep,$is_head,@item$($t)*);};($writer:expr,$($t:tt)*)=>{{$crate::iter_print!(@@inner$writer,' ',true,$($t)*);}};}}
pub use self::scanner::*;
mod scanner{use std::{iter::{repeat_with,FromIterator},marker::PhantomData};pub fn read_stdin_all()->String{use std::io::Read as _;let mut s=String::new();std::io::stdin().read_to_string(&mut s).expect("io error");s}pub fn read_stdin_all_unchecked()->String{use std::io::Read as _;let mut buf=Vec::new();std::io::stdin().read_to_end(&mut buf).expect("io error");unsafe{String::from_utf8_unchecked(buf)}}pub fn read_all(mut reader:impl std::io::Read)->String{let mut s=String::new();reader.read_to_string(&mut s).expect("io error");s}pub fn read_all_unchecked(mut reader:impl std::io::Read)->String{let mut buf=Vec::new();reader.read_to_end(&mut buf).expect("io error");unsafe{String::from_utf8_unchecked(buf)}}pub fn read_stdin_line()->String{let mut s=String::new();std::io::stdin().read_line(&mut s).expect("io error");s}pub trait IterScan:Sized{type Output;fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>;}pub trait MarkedIterScan:Sized{type Output;fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>;}#[derive(Clone,Debug)]pub struct Scanner<'a>{iter:std::str::SplitAsciiWhitespace<'a>}impl<'a>Scanner<'a>{#[inline]pub fn new(s:&'a str)->Self{let iter=s.split_ascii_whitespace();Self{iter}}#[inline]pub fn scan<T>(&mut self)-><T as IterScan>::Output where T:IterScan{<T as IterScan>::scan(&mut self.iter).expect("scan error")}#[inline]pub fn mscan<T>(&mut self,marker:T)-><T as MarkedIterScan>::Output where T:MarkedIterScan{marker.mscan(&mut self.iter).expect("scan error")}#[inline]pub fn scan_vec<T>(&mut self,size:usize)->Vec<<T as IterScan>::Output>where T:IterScan{(0..size).map(|_|<T as IterScan>::scan(&mut self.iter).expect("scan error")).collect()}#[inline]pub fn iter<'b,T>(&'b mut self)->ScannerIter<'a,'b,T>where T:IterScan{ScannerIter{inner:self,_marker:std::marker::PhantomData}}}macro_rules!iter_scan_impls{($($t:ty)*)=>{$(impl IterScan for$t{type Output=Self;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self>{iter.next()?.parse::<$t>().ok()}})*};}iter_scan_impls!(char u8 u16 u32 u64 usize i8 i16 i32 i64 isize f32 f64 u128 i128 String);macro_rules!iter_scan_tuple_impl{(@impl$($T:ident)*)=>{impl<$($T:IterScan),*>IterScan for($($T,)*){type Output=($(<$T as IterScan>::Output,)*);#[inline]fn scan<'a,It:Iterator<Item=&'a str>>(_iter:&mut It)->Option<Self::Output>{Some(($(<$T as IterScan>::scan(_iter)?,)*))}}};(@inner$($T:ident)*,)=>{iter_scan_tuple_impl!(@impl$($T)*);};(@inner$($T:ident)*,$U:ident$($Rest:ident)*)=>{iter_scan_tuple_impl!(@impl$($T)*);iter_scan_tuple_impl!(@inner$($T)*$U,$($Rest)*);};($($T:ident)*)=>{iter_scan_tuple_impl!(@inner,$($T)*);};}iter_scan_tuple_impl!(A B C D E F G H I J K);pub struct ScannerIter<'a,'b,T>{inner:&'b mut Scanner<'a>,_marker:std::marker::PhantomData<fn()->T>}impl<'a,'b,T>Iterator for ScannerIter<'a,'b,T>where T:IterScan{type Item=<T as IterScan>::Output;#[inline]fn next(&mut self)->Option<Self::Item>{<T as IterScan>::scan(&mut self.inner.iter)}}#[doc=" - `scan_value!(scanner, ELEMENT)`"]#[doc=""]#[doc=" ELEMENT :="]#[doc=" - `$ty`: IterScan"]#[doc=" - `@$expr`: MarkedIterScan"]#[doc=" - `[ELEMENT; $expr]`: vector"]#[doc=" - `[ELEMENT]`: iterator"]#[doc=" - `($(ELEMENT)*,)`: tuple"]#[macro_export]macro_rules!scan_value{(@repeat$scanner:expr,[$($t:tt)*]$($len:expr)?)=>{::std::iter::repeat_with(||$crate::scan_value!(@inner$scanner,[]$($t)*))$(.take($len).collect::<Vec<_>>())?};(@tuple$scanner:expr,[$([$($args:tt)*])*])=>{($($($args)*,)*)};(@$tag:ident$scanner:expr,[[$($args:tt)*]])=>{$($args)*};(@$tag:ident$scanner:expr,[$($args:tt)*]@$e:expr)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$scanner.mscan($e)]])};(@$tag:ident$scanner:expr,[$($args:tt)*]@$e:expr,$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$scanner.mscan($e)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*]($($tuple:tt)*)$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@tuple$scanner,[]$($tuple)*)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*][@$e:expr;$len:expr]$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@repeat$scanner,[@$e]$len)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*][[$($tt:tt)*];$len:expr]$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@repeat$scanner,[[$($tt)*]]$len)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*][($($tt:tt)*);$len:expr]$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@repeat$scanner,[($($tt)*)]$len)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*][$ty:ty;$len:expr]$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@repeat$scanner,[$ty]$len)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*][$($tt:tt)*]$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@repeat$scanner,[$($tt)*])]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*]$ty:ty)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$scanner.scan::<$ty>()]])};(@$tag:ident$scanner:expr,[$($args:tt)*]$ty:ty,$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$scanner.scan::<$ty>()]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*],$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*])=>{::std::compile_error!(::std::stringify!($($args)*))};($scanner:expr,$($t:tt)*)=>{$crate::scan_value!(@inner$scanner,[]$($t)*)}}#[doc=" - `scan!(scanner, $($pat $(: ELEMENT)?),*)`"]#[macro_export]macro_rules!scan{(@assert$p:pat)=>{};(@assert$($p:tt)*)=>{::std::compile_error!(::std::concat!("expected pattern, found `",::std::stringify!($($p)*),"`"));};(@pat$scanner:expr,[][])=>{};(@pat$scanner:expr,[][],$($t:tt)*)=>{$crate::scan!(@pat$scanner,[][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]$x:ident$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*$x][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]::$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*::][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]&$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*&][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]($($x:tt)*)$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*($($x)*)][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][][$($x:tt)*]$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*[$($x)*]][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]{$($x:tt)*}$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*{$($x)*}][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]:$($t:tt)*)=>{$crate::scan!(@ty$scanner,[$($p)*][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]$($t:tt)*)=>{$crate::scan!(@let$scanner,[$($p)*][usize]$($t)*)};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*]@$e:expr)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*@$e])};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*]@$e:expr,$($t:tt)*)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*@$e],$($t)*)};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*]($($x:tt)*)$($t:tt)*)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*($($x)*)]$($t)*)};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*][$($x:tt)*]$($t:tt)*)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*[$($x)*]]$($t)*)};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*]$ty:ty)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*$ty])};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*]$ty:ty,$($t:tt)*)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*$ty],$($t)*)};(@let$scanner:expr,[$($p:tt)*][$($tt:tt)*]$($t:tt)*)=>{$crate::scan!{@assert$($p)*}let$($p)* =$crate::scan_value!($scanner,$($tt)*);$crate::scan!(@pat$scanner,[][]$($t)*)};($scanner:expr,$($t:tt)*)=>{$crate::scan!(@pat$scanner,[][]$($t)*)}}#[derive(Debug,Copy,Clone)]pub struct Usize1;impl IterScan for Usize1{type Output=usize;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{<usize as IterScan>::scan(iter)?.checked_sub(1)}}#[derive(Debug,Copy,Clone)]pub struct CharWithBase(pub char);impl MarkedIterScan for CharWithBase{type Output=usize;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{Some((<char as IterScan>::scan(iter)?as u8-self.0 as u8)as usize)}}#[derive(Debug,Copy,Clone)]pub struct Chars;impl IterScan for Chars{type Output=Vec<char>;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{Some(iter.next()?.chars().collect())}}#[derive(Debug,Copy,Clone)]pub struct CharsWithBase(pub char);impl MarkedIterScan for CharsWithBase{type Output=Vec<usize>;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{Some(iter.next()?.chars().map(|c|(c as u8-self.0 as u8)as usize).collect())}}#[derive(Debug,Copy,Clone)]pub struct ByteWithBase(pub u8);impl MarkedIterScan for ByteWithBase{type Output=usize;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{Some((<char as IterScan>::scan(iter)?as u8-self.0)as usize)}}#[derive(Debug,Copy,Clone)]pub struct Bytes;impl IterScan for Bytes{type Output=Vec<u8>;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{Some(iter.next()?.bytes().collect())}}#[derive(Debug,Copy,Clone)]pub struct BytesWithBase(pub u8);impl MarkedIterScan for BytesWithBase{type Output=Vec<usize>;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{Some(iter.next()?.bytes().map(|c|(c-self.0)as usize).collect())}}#[derive(Debug,Copy,Clone)]pub struct Collect<T,B=Vec<<T as IterScan>::Output>>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{size:usize,_marker:PhantomData<fn()->(T,B)>}impl<T,B>Collect<T,B>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{pub fn new(size:usize)->Self{Self{size,_marker:PhantomData}}}impl<T,B>MarkedIterScan for Collect<T,B>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{type Output=B;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{repeat_with(||<T as IterScan>::scan(iter)).take(self.size).collect()}}#[derive(Debug,Copy,Clone)]pub struct SizedCollect<T,B=Vec<<T as IterScan>::Output>>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{_marker:PhantomData<fn()->(T,B)>}impl<T,B>IterScan for SizedCollect<T,B>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{type Output=B;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{let size=usize::scan(iter)?;repeat_with(||<T as IterScan>::scan(iter)).take(size).collect()}}impl<T,F>MarkedIterScan for F where F:Fn(&str)->Option<T>{type Output=T;fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{self(iter.next()?)}}}
pub use fast_fourier_transform_impls::convolve_fft;
pub mod fast_fourier_transform_impls{use super::*;struct RotateCache;impl RotateCache{fn ensure(n:usize){assert_eq!(n.count_ones(),1,"call with power of two but {}",n);Self::modify(|cache|{let mut m=cache.len();assert!(m.count_ones()<=1,"length might be power of two but {}",m);if m>=n{return;}cache.reserve_exact(n-m);if cache.is_empty(){cache.push(Complex::one());m+=1;}while m<n{let p=Complex::polar(1.,-std::f64::consts::PI/(m*2)as f64);for i in 0..m{cache.push(cache[i]*p);}m<<=1;}assert_eq!(cache.len(),n);});}}impl_assoc_value!(RotateCache,Vec<Complex<f64>>,vec![Complex::one()]);pub fn convolve_fft<IA,T,IB,U>(a:IA,b:IB)->Vec<i64>where T:Into<f64>,U:Into<f64>,IA:IntoIterator<Item=T>,IA::IntoIter:ExactSizeIterator,IB:IntoIterator<Item=U>,IB::IntoIter:ExactSizeIterator{let a=a.into_iter();let b=b.into_iter();let alen=a.len();let blen=b.len();assert_ne!(alen,0,"empty sequence on first argument");assert_ne!(blen,0,"empty sequence on second argument");let m=alen+blen-1;let n=(std::cmp::max(m,2)).next_power_of_two();let mut c=vec![Complex::zero();n];for(c,a)in c.iter_mut().zip(a){c.re=a.into();}for(c,b)in c.iter_mut().zip(b){c.im=b.into();}RotateCache::ensure(n/2);RotateCache::with(|cache|{fft(&mut c,&cache);c[0]=Complex::new(0.,c[0].re*c[0].im);c[1]=Complex::new(0.,c[1].re*c[1].im);for i in(2..n).step_by(2){let j={let y=1<<(63-i.leading_zeros());(!i&(y-1))^y};c[i]=(c[i]+c[j].conjugate())*(c[i]-c[j].conjugate())/4.;c[j]=-c[i].conjugate();}for i in 0..n/2{let mut wi=cache[i]*Complex::i();wi.re+=1.;c[i]=c[i*2]-(c[i*2]-c[i*2+1])*wi/2.;}ifft(&mut c[..n/2],&cache);});(0..m).map(|i|{(if i&1==0{c[i/2].im}else{c[i/2+1].re}/((n/2)as f64)).round()as _}).collect()}#[allow(clippy::needless_range_loop)]fn fft(a:&mut[Complex<f64>],cache:&[Complex<f64>]){let n=a.len();let mut u=1;let mut v=n/2;for i in(1..=n.trailing_zeros()).rev(){for jh in 0..u{let wj=cache[jh];for j in jh<<i..(jh<<i)+v{let ajv=wj*a[j+v];a[j+v]=a[j]-ajv;a[j]+=ajv;}}u<<=1;v>>=1;}}#[allow(clippy::needless_range_loop)]fn ifft(a:&mut[Complex<f64>],cache:&[Complex<f64>]){let n=a.len();let mut u=n/2;let mut v=1;for i in 1..=n.trailing_zeros(){for jh in 0..u{let wj=cache[jh].conjugate();for j in jh<<i..(jh<<i)+v{let ajv=a[j]-a[j+v];a[j]+=a[j+v];a[j+v]=wj*ajv;}}u>>=1;v<<=1;}}pub fn fast_fourier_transform(mut f:Vec<Complex<f64>>,inv:bool)->Vec<Complex<f64>>{let n=f.len();debug_assert!(n.count_ones()==1);let mask=n-1;const TAU:f64=2.*std::f64::consts::PI;let omega=if inv{-TAU/n as f64}else{TAU/n as f64};let mut g=vec![Complex::<f64>::default();n];let mut i=n/2;while i>=1{let t=Complex::polar(1.,omega*i as f64);let mut w=Complex::<f64>::one();for j in(0..n).step_by(i){for k in 0..i{g[j+k]=f[((j*2)&mask)+k]+w*f[((j*2+i)&mask)+k];}w*=t;}i/=2;std::mem::swap(&mut f,&mut g);}if inv{for a in f.iter_mut(){*a/=n as f64;}}f}}
pub use self::associated_value::AssociatedValue;
mod associated_value{#[doc=" Trait for a modifiable value associated with a type."]pub trait AssociatedValue{#[doc=" Type of value."]type T:'static+Clone;fn local_key()->&'static std::thread::LocalKey<std::cell::UnsafeCell<Self::T>>;#[inline]fn get()->Self::T{Self::with(Clone::clone)}#[inline]fn set(x:Self::T){Self::local_key().with(|cell|unsafe{*cell.get()=x})}#[inline]fn with<F,R>(f:F)->R where F:FnOnce(&Self::T)->R{Self::local_key().with(|cell|unsafe{f(&*cell.get())})}#[inline]fn modify<F,R>(f:F)->R where F:FnOnce(&mut Self::T)->R{Self::local_key().with(|cell|unsafe{f(&mut*cell.get())})}}#[doc=" Implement [`AssociatedValue`]."]#[doc=""]#[doc=" [`AssociatedValue`]: super::AssociatedValue"]#[doc=""]#[doc=" # Examples"]#[doc=""]#[doc=" ```"]#[doc=" use competitive::tools::AssociatedValue;"]#[doc=" struct X;"]#[doc=" competitive::impl_assoc_value!(X, usize, 1);"]#[doc=" assert_eq!(X::get(), 1);"]#[doc=" X::set(10);"]#[doc=" assert_eq!(X::get(), 10);"]#[doc=" ```"]#[doc=""]#[doc=" init with `Default::default()`"]#[doc=""]#[doc=" ```"]#[doc=" use competitive::tools::AssociatedValue;"]#[doc=" struct X;"]#[doc=" competitive::impl_assoc_value!(X, usize);"]#[doc=" assert_eq!(X::get(), Default::default());"]#[doc=" ```"]#[macro_export]macro_rules!impl_assoc_value{($name:ident,$t:ty)=>{$crate::impl_assoc_value!($name,$t,Default::default());};($name:ident,$t:ty,$e:expr)=>{impl AssociatedValue for$name{type T=$t;#[inline]fn local_key()->&'static::std::thread::LocalKey<::std::cell::UnsafeCell<Self::T>>{::std::thread_local!(static __LOCAL_KEY: ::std::cell::UnsafeCell<$t> =::std::cell::UnsafeCell::new($e));&__LOCAL_KEY}}};}}
pub use self::complex::Complex;
mod complex{use super::{One,Zero};use std::{iter::{Product,Sum},ops::{Add,AddAssign,Div,DivAssign,Mul,MulAssign,Neg,Sub,SubAssign}};#[derive(Clone,Copy,Debug,Default,PartialEq,Eq,Hash)]pub struct Complex<T>{pub re:T,pub im:T}impl<T>Complex<T>{pub fn new(re:T,im:T)->Self{Complex{re,im}}pub fn transpose(self)->Self{Complex{re:self.im,im:self.re}}}impl<T>Zero for Complex<T>where T:Zero{fn zero()->Self{Self::new(T::zero(),T::zero())}}impl<T>One for Complex<T>where T:Zero+One{fn one()->Self{Self::new(T::one(),T::zero())}}impl<T>Complex<T>where T:Zero+One{pub fn i()->Self{Self::new(T::zero(),T::one())}}impl<T>Complex<T>where T:Neg<Output=T>{pub fn conjugate(self)->Self{Self::new(self.re,-self.im)}}impl<T>Complex<T>where T:Add<Output=T>+Mul<Output=T>{pub fn dot(self,rhs:Self)->T{self.re*rhs.re+self.im*rhs.im}}impl<T>Complex<T>where T:Sub<Output=T>+Mul<Output=T>{pub fn cross(self,rhs:Self)->T{self.re*rhs.im-self.im*rhs.re}}impl<T>Complex<T>where T:Clone+Add<Output=T>+Mul<Output=T>{pub fn norm(self)->T{self.re.clone()*self.re+self.im.clone()*self.im}}impl Complex<f64>{pub fn polar(r:f64,theta:f64)->Self{Self::new(r*theta.cos(),r*theta.sin())}pub fn abs(self)->f64{self.re.hypot(self.im)}pub fn unit(self)->Self{self/self.abs()}pub fn angle(self)->f64{self.im.atan2(self.re)}}impl<T>Add for Complex<T>where T:Add<Output=T>{type Output=Self;fn add(self,rhs:Self)->Self::Output{Self::new(self.re+rhs.re,self.im+rhs.im)}}impl<T>Add<T>for Complex<T>where T:Add<Output=T>{type Output=Self;fn add(self,rhs:T)->Self::Output{Self::new(self.re+rhs,self.im)}}impl<T>Sub for Complex<T>where T:Sub<Output=T>{type Output=Self;fn sub(self,rhs:Self)->Self::Output{Self::new(self.re-rhs.re,self.im-rhs.im)}}impl<T>Sub<T>for Complex<T>where T:Sub<Output=T>{type Output=Self;fn sub(self,rhs:T)->Self::Output{Self::new(self.re-rhs,self.im)}}impl<T>Mul for Complex<T>where T:Clone+Add<Output=T>+Sub<Output=T>+Mul<Output=T>{type Output=Self;fn mul(self,rhs:Self)->Self::Output{Self::new(self.re.clone()*rhs.re.clone()-self.im.clone()*rhs.im.clone(),self.re*rhs.im+self.im*rhs.re)}}impl<T>Mul<T>for Complex<T>where T:Clone+Mul<Output=T>{type Output=Self;fn mul(self,rhs:T)->Self::Output{Self::new(self.re*rhs.clone(),self.im*rhs)}}impl<T>Div for Complex<T>where T:Clone+Add<Output=T>+Sub<Output=T>+Mul<Output=T>+Div<Output=T>{type Output=Self;fn div(self,rhs:Self)->Self::Output{let d=rhs.re.clone()*rhs.re.clone()+rhs.im.clone()*rhs.im.clone();Self::new((self.re.clone()*rhs.re.clone()+self.im.clone()*rhs.im.clone())/d.clone(),(self.im*rhs.re-self.re*rhs.im)/d)}}impl<T>Div<T>for Complex<T>where T:Clone+Div<Output=T>{type Output=Self;fn div(self,rhs:T)->Self::Output{Self::new(self.re/rhs.clone(),self.im/rhs)}}impl<T>Neg for Complex<T>where T:Neg<Output=T>{type Output=Self;fn neg(self)->Self::Output{Self::new(-self.re,-self.im)}}macro_rules!impl_complex_ref_binop{(impl<$T:ident>$imp:ident$method:ident($l:ty,$r:ty)where$($w:ident)*)=>{impl<$T>$imp<$r>for&$l where$T:Clone$(+$w<Output=$T>)*,{type Output=<$l as$imp<$r>>::Output;fn$method(self,rhs:$r)-><$l as$imp<$r>>::Output{$imp::$method(self.clone(),rhs)}}impl<$T>$imp<&$r>for$l where$T:Clone$(+$w<Output=$T>)*,{type Output=<$l as$imp<$r>>::Output;fn$method(self,rhs:&$r)-><$l as$imp<$r>>::Output{$imp::$method(self,rhs.clone())}}impl<$T>$imp<&$r>for&$l where$T:Clone$(+$w<Output=$T>)*,{type Output=<$l as$imp<$r>>::Output;fn$method(self,rhs:&$r)-><$l as$imp<$r>>::Output{$imp::$method(self.clone(),rhs.clone())}}};}impl_complex_ref_binop!(impl<T>Add add(Complex<T>,Complex<T>)where Add);impl_complex_ref_binop!(impl<T>Add add(Complex<T>,T)where Add);impl_complex_ref_binop!(impl<T>Sub sub(Complex<T>,Complex<T>)where Sub);impl_complex_ref_binop!(impl<T>Sub sub(Complex<T>,T)where Sub);impl_complex_ref_binop!(impl<T>Mul mul(Complex<T>,Complex<T>)where Add Sub Mul);impl_complex_ref_binop!(impl<T>Mul mul(Complex<T>,T)where Mul);impl_complex_ref_binop!(impl<T>Div div(Complex<T>,Complex<T>)where Add Sub Mul Div);impl_complex_ref_binop!(impl<T>Div div(Complex<T>,T)where Div);macro_rules!impl_complex_ref_unop{(impl<$T:ident>$imp:ident$method:ident($t:ty)where$($w:ident)*)=>{impl<$T>$imp for&$t where$T:Clone$(+$w<Output=$T>)*,{type Output=<$t as$imp>::Output;fn$method(self)-><$t as$imp>::Output{$imp::$method(self.clone())}}};}impl_complex_ref_unop!(impl<T>Neg neg(Complex<T>)where Neg);macro_rules!impl_complex_op_assign{(impl<$T:ident>$imp:ident$method:ident($l:ty,$r:ty)$fromimp:ident$frommethod:ident where$($w:ident)*)=>{impl<$T>$imp<$r>for$l where$T:Clone$(+$w<Output=$T>)*,{fn$method(&mut self,rhs:$r){*self=$fromimp::$frommethod(self.clone(),rhs);}}impl<$T>$imp<&$r>for$l where$T:Clone$(+$w<Output=$T>)*,{fn$method(&mut self,rhs:&$r){$imp::$method(self,rhs.clone());}}};}impl_complex_op_assign!(impl<T>AddAssign add_assign(Complex<T>,Complex<T>)Add add where Add);impl_complex_op_assign!(impl<T>AddAssign add_assign(Complex<T>,T)Add add where Add);impl_complex_op_assign!(impl<T>SubAssign sub_assign(Complex<T>,Complex<T>)Sub sub where Sub);impl_complex_op_assign!(impl<T>SubAssign sub_assign(Complex<T>,T)Sub sub where Sub);impl_complex_op_assign!(impl<T>MulAssign mul_assign(Complex<T>,Complex<T>)Mul mul where Add Sub Mul);impl_complex_op_assign!(impl<T>MulAssign mul_assign(Complex<T>,T)Mul mul where Mul);impl_complex_op_assign!(impl<T>DivAssign div_assign(Complex<T>,Complex<T>)Div div where Add Sub Mul Div);impl_complex_op_assign!(impl<T>DivAssign div_assign(Complex<T>,T)Div div where Div);macro_rules!impl_complex_fold{(impl<$T:ident>$imp:ident$method:ident($t:ty)$identimp:ident$identmethod:ident$fromimp:ident$frommethod:ident where$($w:ident)*$(+$x:ident)*)=>{impl<$T>$imp for$t where$T:$identimp$(+$w<Output=$T>)*$(+$x)*,{fn$method<I:Iterator<Item=Self>>(iter:I)->Self{iter.fold(<Self as$identimp>::$identmethod(),$fromimp::$frommethod)}}impl<'a,$T:'a>$imp<&'a$t>for$t where$T:Clone+$identimp$(+$w<Output=$T>)*$(+$x)*,{fn$method<I:Iterator<Item=&'a$t>>(iter:I)->Self{iter.fold(<Self as$identimp>::$identmethod(),$fromimp::$frommethod)}}};}impl_complex_fold!(impl<T>Sum sum(Complex<T>)Zero zero Add add where Add);impl_complex_fold!(impl<T>Product product(Complex<T>)One one Mul mul where Add Sub Mul+Zero+Clone);}
pub use self::zero_one::{One,Zero};
mod zero_one{pub trait Zero:Sized{fn zero()->Self;#[inline]fn is_zero(&self)->bool where Self:PartialEq{self==&Self::zero()}#[inline]fn set_zero(&mut self){*self=Self::zero();}}pub trait One:Sized{fn one()->Self;#[inline]fn is_one(&self)->bool where Self:PartialEq{self==&Self::one()}#[inline]fn set_one(&mut self){*self=Self::one();}}macro_rules!zero_one_impls{($({$Trait:ident$method:ident$($t:ty)*,$e:expr})*)=>{$($(impl$Trait for$t{fn$method()->Self{$e}})*)*};}zero_one_impls!({Zero zero u8 u16 u32 u64 usize i8 i16 i32 i64 isize u128 i128,0}{Zero zero f32 f64,0.}{One one u8 u16 u32 u64 usize i8 i16 i32 i64 isize u128 i128,1}{One one f32 f64,1.});}
pub struct NumberTheoreticTransform<M:MIntBase>(std::marker::PhantomData<fn()->M>);
pub trait NttModulus:'static+Sized+MIntBase+AssociatedValue<T=number_theoretic_transform_impls::NttCache<Self>>{fn primitive_root()->MInt<Self>;}
pub mod number_theoretic_transform_impls{use super::*;use mint_basic::Modulo998244353;macro_rules!impl_ntt_modulus{($([$name:ident,$g:expr]),*)=>{$(impl NttModulus for$name{fn primitive_root()->MInt<Self>{MInt::new_unchecked($g)}}impl_assoc_value!($name,NttCache<$name>,NttCache::new());)*};}impl_ntt_modulus!([Modulo998244353,3],[Modulo2113929217,5],[Modulo1811939329,13],[Modulo2013265921,31]);crate::define_basic_mint32!([Modulo2113929217,2_113_929_217,MInt2113929217],[Modulo1811939329,1_811_939_329,MInt1811939329],[Modulo2013265921,2_013_265_921,MInt2013265921]);#[derive(Debug)]pub struct NttCache<M:NttModulus>{cache:Vec<MInt<M>>,icache:Vec<MInt<M>>}impl<M:NttModulus>Clone for NttCache<M>{fn clone(&self)->Self{Self{cache:self.cache.clone(),icache:self.icache.clone()}}}impl<M:NttModulus+MIntConvert<usize>>NttCache<M>{fn new()->Self{Self{cache:Vec::new(),icache:Vec::new()}}fn ensure(&mut self,n:usize){assert_eq!(n.count_ones(),1,"call with power of two but {}",n);let mut m=self.cache.len();assert!(m.count_ones()<=1,"length might be power of two but {}",m);if m>=n{return;}let q:usize=M::mod_into()-1;self.cache.reserve_exact(n-m);self.icache.reserve_exact(n-m);if self.cache.is_empty(){self.cache.push(MInt::one());self.icache.push(MInt::one());m+=1;}while m<n{let p=M::primitive_root().pow(q/(m*4));let pinv=p.inv();for i in 0..m{self.cache.push(self.cache[i]*p);self.icache.push(self.icache[i]*pinv);}m<<=1;}assert_eq!(self.cache.len(),n);}}impl<M:NttModulus+MIntConvert<usize>>NumberTheoreticTransform<M>{fn convolve_inner(mut a:Vec<MInt<M>>,mut b:Vec<MInt<M>>)->Vec<MInt<M>>{Self::ntt(&mut a);Self::ntt(&mut b);for(a,b)in a.iter_mut().zip(b.iter_mut()){*a*=*b;}Self::intt(&mut a);a}#[allow(clippy::needless_range_loop)]fn ntt(a:&mut[MInt<M>]){M::modify(|cache|{let n=a.len();cache.ensure(n/2);let mut u=1;let mut v=n/2;for i in(1..=n.trailing_zeros()).rev(){for jh in 0..u{let wj=cache.cache[jh];for j in jh<<i..(jh<<i)+v{let ajv=wj*a[j+v];a[j+v]=a[j]-ajv;a[j]+=ajv;}}u<<=1;v>>=1;}});}#[allow(clippy::needless_range_loop)]fn intt(a:&mut[MInt<M>]){M::modify(|cache|{let n=a.len();cache.ensure(n/2);let mut u=n/2;let mut v=1;for i in 1..=n.trailing_zeros(){for jh in 0..u{let wj=cache.icache[jh];for j in jh<<i..(jh<<i)+v{let ajv=a[j]-a[j+v];a[j]+=a[j+v];a[j+v]=wj*ajv;}}u>>=1;v<<=1;}});}pub fn convert<T:Into<MInt<M>>,I:IntoIterator<Item=T>>(iter:I)->Vec<MInt<M>>{iter.into_iter().map(|x|x.into()).collect()}pub fn convolve(mut a:Vec<MInt<M>>,mut b:Vec<MInt<M>>)->Vec<MInt<M>>{let m=a.len()+b.len()-1;let n=m.max(2).next_power_of_two();a.resize_with(n,Zero::zero);b.resize_with(n,Zero::zero);let mut c=Self::convolve_inner(a,b);c.truncate(m);let ninv=MInt::from(n).inv();for c in c.iter_mut(){*c*=ninv;}c}pub fn convolve_ref<T:Clone+Into<MInt<M>>>(a:&[T],b:&[T])->Vec<MInt<M>>{let m=a.len()+b.len()-1;let n=m.max(2).next_power_of_two();let a=a.iter().map(|a|a.clone().into()).chain(std::iter::repeat_with(Zero::zero)).take(n).collect();let b=b.iter().map(|b|b.clone().into()).chain(std::iter::repeat_with(Zero::zero)).take(n).collect();let mut c=Self::convolve_inner(a,b);c.truncate(m);let ninv=MInt::from(n).inv();for c in c.iter_mut(){*c*=ninv;}c}pub fn convolve_it<T,I>(iter1:I,iter2:I)->Vec<MInt<M>>where T:Into<MInt<M>>,I:IntoIterator<Item=T>{Self::convolve(Self::convert(iter1),Self::convert(iter2))}}}
pub type Ntt998244353=NumberTheoreticTransform<mint_basic::Modulo998244353>;
#[doc=" max(a.len(), b.len()) * max(a) * max(b) < 3.64 * 10^18"]pub fn convolve2<T>(a:&[T],b:&[T])->Vec<u64>where T:Clone+Into<number_theoretic_transform_impls::MInt2013265921>+Into<number_theoretic_transform_impls::MInt1811939329>{type M1=number_theoretic_transform_impls::Modulo2013265921;type M2=number_theoretic_transform_impls::Modulo1811939329;let c1=NumberTheoreticTransform::<M1>::convolve_ref(&a,&b);let c2=NumberTheoreticTransform::<M2>::convolve_ref(&a,&b);let p1:u64=M1::mod_into();let p1_inv=MInt::<M2>::new(M1::get_mod()).inv();c1.into_iter().zip(c2.into_iter()).map(|(c1,c2)|{c1.inner()as u64+p1*((c2-MInt::<M2>::from(c1.inner()))*p1_inv).inner()as u64}).collect()}
#[doc=" max(a.len(), b.len()) * max(a) * max(b) < 1.81 * 10^27"]pub fn convolve_mint<M>(a:&[MInt<M>],b:&[MInt<M>])->Vec<MInt<M>>where M:MIntConvert<u32>{type M1=number_theoretic_transform_impls::Modulo2013265921;type M2=number_theoretic_transform_impls::Modulo1811939329;type M3=number_theoretic_transform_impls::Modulo2113929217;let cvt=|a:&MInt<M>|->u32{(*a).into()};let c1=NumberTheoreticTransform::<M1>::convolve_it(a.iter().map(cvt),b.iter().map(cvt));let c2=NumberTheoreticTransform::<M2>::convolve_it(a.iter().map(cvt),b.iter().map(cvt));let c3=NumberTheoreticTransform::<M3>::convolve_it(a.iter().map(cvt),b.iter().map(cvt));let t1=MInt::<M2>::new(M1::get_mod()).inv();let m1=MInt::<M>::from(M1::get_mod());let m13=MInt::<M3>::new(M1::get_mod());let t2=(MInt::<M3>::new(M1::get_mod())*MInt::<M3>::new(M2::get_mod())).inv();let m2=m1*MInt::<M>::from(M2::get_mod());c1.into_iter().zip(c2.into_iter()).zip(c3.into_iter()).map(|((c1,c2),c3)|{let x=MInt::<M3>::new(c1.inner())+MInt::<M3>::new(((c2-MInt::<M2>::from(c1.inner()))*t1).inner())*m13;MInt::<M>::from(c1.inner())+MInt::<M>::from(((c2-MInt::<M2>::from(c1.inner()))*t1).inner())*m1+MInt::<M>::from(((c3-MInt::<M3>::from(x.inner()))*t2).inner())*m2}).collect()}
#[doc=" max(a.len(), b.len()) * max(a) * max(b) < 1.81 * 10^27"]pub fn convolve3<T>(mut a:Vec<T>,mut b:Vec<T>)->Vec<u128>where T:Into<MInt<number_theoretic_transform_impls::Modulo2013265921>>+Into<MInt<number_theoretic_transform_impls::Modulo1811939329>>+Into<MInt<number_theoretic_transform_impls::Modulo2113929217>>+Clone+Zero{let m=a.len()+b.len()-1;let n=m.next_power_of_two();a.resize_with(n,Zero::zero);b.resize_with(n,Zero::zero);type M1=number_theoretic_transform_impls::Modulo2013265921;type M2=number_theoretic_transform_impls::Modulo1811939329;type M3=number_theoretic_transform_impls::Modulo2113929217;let c1=NumberTheoreticTransform::<M1>::convolve_it(a.iter().cloned(),b.iter().cloned());let c2=NumberTheoreticTransform::<M2>::convolve_it(a.iter().cloned(),b.iter().cloned());let c3=NumberTheoreticTransform::<M3>::convolve_it(a.iter().cloned(),b.iter().cloned());let p1=M1::get_mod();let t1=MInt::<M2>::new(p1).inv();let m1=p1 as u64;let p2=M2::get_mod();let t2=(MInt::<M3>::new(p1)*MInt::<M3>::new(p2)).inv();let m2=m1 as u128*p2 as u128;c1.into_iter().zip(c2.into_iter()).zip(c3.into_iter()).take(m).map(|((c1,c2),c3)|{let x=c1.inner()as u64+((c2-MInt::<M2>::from(c1.inner()))*t1).inner()as u64*m1;x as u128+((c3-MInt::<M3>::from(x))*t2).inner()as u128*m2}).collect()}
pub mod mint_basic{use super::*;#[macro_export]macro_rules!define_basic_mintbase{($name:ident,$m:expr,$basety:ty,$signedty:ty,$upperty:ty,[$($unsigned:ty),*],[$($signed:ty),*])=>{pub struct$name;impl MIntBase for$name{type Inner=$basety;#[inline]fn get_mod()->Self::Inner{$m}#[inline]fn mod_zero()->Self::Inner{0}#[inline]fn mod_one()->Self::Inner{1}#[inline]fn mod_add(x:Self::Inner,y:Self::Inner)->Self::Inner{let z=x+y;let m=Self::get_mod();if z>=m{z-m}else{z}}#[inline]fn mod_sub(x:Self::Inner,y:Self::Inner)->Self::Inner{if x<y{x+Self::get_mod()-y}else{x-y}}#[inline]fn mod_mul(x:Self::Inner,y:Self::Inner)->Self::Inner{(x as$upperty*y as$upperty%Self::get_mod()as$upperty)as$basety}#[inline]fn mod_div(x:Self::Inner,y:Self::Inner)->Self::Inner{Self::mod_mul(x,Self::mod_inv(y))}#[inline]fn mod_neg(x:Self::Inner)->Self::Inner{if x==0{0}else{Self::get_mod()-x}}fn mod_inv(x:Self::Inner)->Self::Inner{let p=Self::get_mod()as$signedty;let(mut a,mut b)=(x as$signedty,p);let(mut u,mut x)=(1,0);while a!=0{let k=b/a;x-=k*u;b-=k*a;std::mem::swap(&mut x,&mut u);std::mem::swap(&mut b,&mut a);}(if x<0{x+p}else{x})as _}}$(impl MIntConvert<$unsigned>for$name{#[inline]fn from(x:$unsigned)->Self::Inner{(x%<Self as MIntBase>::get_mod()as$unsigned)as$basety}#[inline]fn into(x:Self::Inner)->$unsigned{x as$unsigned}#[inline]fn mod_into()->$unsigned{<Self as MIntBase>::get_mod()as$unsigned}})*$(impl MIntConvert<$signed>for$name{#[inline]fn from(x:$signed)->Self::Inner{let x=x%<Self as MIntBase>::get_mod()as$signed;if x<0{(x+<Self as MIntBase>::get_mod()as$signed)as$basety}else{x as$basety}}#[inline]fn into(x:Self::Inner)->$signed{x as$signed}#[inline]fn mod_into()->$signed{<Self as MIntBase>::get_mod()as$signed}})*};}#[macro_export]macro_rules!define_basic_mint32{($([$name:ident,$m:expr,$mint_name:ident]),*)=>{$(crate::define_basic_mintbase!($name,$m,u32,i32,u64,[u32,u64,u128,usize],[i32,i64,i128,isize]);pub type$mint_name=MInt<$name>;)*};}define_basic_mint32!([Modulo998244353,998_244_353,MInt998244353],[Modulo1000000007,1_000_000_007,MInt1000000007],[Modulo1000000009,1_000_000_009,MInt1000000009],[DynModuloU32,DYN_MODULUS_U32.with(|cell|unsafe{*cell.get()}),DynMIntU32]);thread_local!(static DYN_MODULUS_U32:std::cell::UnsafeCell<u32> =std::cell::UnsafeCell::new(1_000_000_007));impl DynModuloU32{pub fn set_mod(m:u32){DYN_MODULUS_U32.with(|cell|unsafe{*cell.get()=m})}}thread_local!(static DYN_MODULUS_U64:std::cell::UnsafeCell<u64> =std::cell::UnsafeCell::new(1_000_000_007));define_basic_mintbase!(DynModuloU64,DYN_MODULUS_U64.with(|cell|unsafe{*cell.get()}),u64,i64,u128,[u64,u128,usize],[i64,i128,isize]);impl DynModuloU64{pub fn set_mod(m:u64){DYN_MODULUS_U64.with(|cell|unsafe{*cell.get()=m})}}pub type DynMIntU64=MInt<DynModuloU64>;pub struct Modulo2;impl MIntBase for Modulo2{type Inner=u32;#[inline]fn get_mod()->Self::Inner{2}#[inline]fn mod_zero()->Self::Inner{0}#[inline]fn mod_one()->Self::Inner{1}#[inline]fn mod_add(x:Self::Inner,y:Self::Inner)->Self::Inner{x^y}#[inline]fn mod_sub(x:Self::Inner,y:Self::Inner)->Self::Inner{x^y}#[inline]fn mod_mul(x:Self::Inner,y:Self::Inner)->Self::Inner{x&y}#[inline]fn mod_div(x:Self::Inner,y:Self::Inner)->Self::Inner{assert_ne!(y,0);x}#[inline]fn mod_neg(x:Self::Inner)->Self::Inner{x}#[inline]fn mod_inv(x:Self::Inner)->Self::Inner{assert_ne!(x,0);x}#[inline]fn mod_pow(x:Self::Inner,y:usize)->Self::Inner{if y==0{1}else{x}}}macro_rules!impl_to_mint_base_for_modulo2{($name:ident,$basety:ty,[$($t:ty),*])=>{$(impl MIntConvert<$t>for$name{#[inline]fn from(x:$t)->Self::Inner{(x&1)as$basety}#[inline]fn into(x:Self::Inner)->$t{x as$t}#[inline]fn mod_into()->$t{1}})*};}impl_to_mint_base_for_modulo2!(Modulo2,u32,[u8,u16,u32,u64,u128,usize,i8,i16,i32,i64,i128,isize]);pub type MInt2=MInt<Modulo2>;}
#[repr(transparent)]pub struct MInt<M>where M:MIntBase{x:M::Inner,_marker:std::marker::PhantomData<fn()->M>}
pub trait MIntBase{type Inner:Sized+Copy+Eq+std::fmt::Debug+std::hash::Hash;fn get_mod()->Self::Inner;fn mod_zero()->Self::Inner;fn mod_one()->Self::Inner;fn mod_add(x:Self::Inner,y:Self::Inner)->Self::Inner;fn mod_sub(x:Self::Inner,y:Self::Inner)->Self::Inner;fn mod_mul(x:Self::Inner,y:Self::Inner)->Self::Inner;fn mod_div(x:Self::Inner,y:Self::Inner)->Self::Inner;fn mod_neg(x:Self::Inner)->Self::Inner;fn mod_inv(x:Self::Inner)->Self::Inner;fn mod_pow(x:Self::Inner,y:usize)->Self::Inner{let(mut x,mut y,mut z)=(x,y,Self::mod_one());while y>0{if y&1==1{z=Self::mod_mul(z,x);}x=Self::mod_mul(x,x);y>>=1;}z}}
pub trait MIntConvert<T=<Self as MIntBase>::Inner>:MIntBase{fn from(x:T)-><Self as MIntBase>::Inner;fn into(x:<Self as MIntBase>::Inner)->T;fn mod_into()->T;}
mod mint_base{use super::*;use std::{fmt::{self,Debug,Display},hash::{Hash,Hasher},iter::{Product,Sum},marker::PhantomData,ops::{Add,AddAssign,Div,DivAssign,Mul,MulAssign,Neg,Sub,SubAssign},str::FromStr};impl<M>MInt<M>where M:MIntConvert{#[inline]pub fn new(x:M::Inner)->Self{Self::new_unchecked(<M as MIntConvert<M::Inner>>::from(x))}#[inline]pub fn inner(self)->M::Inner{<M as MIntConvert<M::Inner>>::into(self.x)}}impl<M>MInt<M>where M:MIntBase{#[inline]pub fn new_unchecked(x:M::Inner)->Self{Self{x,_marker:PhantomData}}#[inline]pub fn get_mod()->M::Inner{M::get_mod()}#[inline]pub fn pow(self,y:usize)->Self{Self::new_unchecked(M::mod_pow(self.x,y))}#[inline]pub fn inv(self)->Self{Self::new_unchecked(M::mod_inv(self.x))}}impl<M>Clone for MInt<M>where M:MIntBase{#[inline]fn clone(&self)->Self{Self{x:Clone::clone(&self.x),_marker:PhantomData}}}impl<M>Copy for MInt<M>where M:MIntBase{}impl<M>Debug for MInt<M>where M:MIntBase{fn fmt(&self,f:&mut fmt::Formatter<'_>)->fmt::Result{Debug::fmt(&self.x,f)}}impl<M>Default for MInt<M>where M:MIntBase{#[inline]fn default()->Self{<Self as Zero>::zero()}}impl<M>PartialEq for MInt<M>where M:MIntBase{#[inline]fn eq(&self,other:&Self)->bool{PartialEq::eq(&self.x,&other.x)}}impl<M>Eq for MInt<M>where M:MIntBase{}impl<M>Hash for MInt<M>where M:MIntBase{#[inline]fn hash<H:Hasher>(&self,state:&mut H){Hash::hash(&self.x,state)}}macro_rules!impl_mint_from{($($t:ty),*)=>{$(impl<M>From<$t>for MInt<M>where M:MIntConvert<$t>,{#[inline]fn from(x:$t)->Self{Self::new_unchecked(<M as MIntConvert<$t>>::from(x))}}impl<M>From<MInt<M>>for$t where M:MIntConvert<$t>,{#[inline]fn from(x:MInt<M>)->$t{<M as MIntConvert<$t>>::into(x.x)}})*};}impl_mint_from!(u8,u16,u32,u64,u128,usize,i8,i16,i32,i64,i128,isize);impl<M>Zero for MInt<M>where M:MIntBase{#[inline]fn zero()->Self{Self::new_unchecked(M::mod_zero())}}impl<M>One for MInt<M>where M:MIntBase{#[inline]fn one()->Self{Self::new_unchecked(M::mod_one())}}impl<M>Add for MInt<M>where M:MIntBase{type Output=Self;#[inline]fn add(self,rhs:Self)->Self::Output{Self::new_unchecked(M::mod_add(self.x,rhs.x))}}impl<M>Sub for MInt<M>where M:MIntBase{type Output=Self;#[inline]fn sub(self,rhs:Self)->Self::Output{Self::new_unchecked(M::mod_sub(self.x,rhs.x))}}impl<M>Mul for MInt<M>where M:MIntBase{type Output=Self;#[inline]fn mul(self,rhs:Self)->Self::Output{Self::new_unchecked(M::mod_mul(self.x,rhs.x))}}impl<M>Div for MInt<M>where M:MIntBase{type Output=Self;#[inline]fn div(self,rhs:Self)->Self::Output{Self::new_unchecked(M::mod_div(self.x,rhs.x))}}impl<M>Neg for MInt<M>where M:MIntBase{type Output=Self;#[inline]fn neg(self)->Self::Output{Self::new_unchecked(M::mod_neg(self.x))}}impl<M>Sum for MInt<M>where M:MIntBase{#[inline]fn sum<I:Iterator<Item=Self>>(iter:I)->Self{iter.fold(<Self as Zero>::zero(),Add::add)}}impl<M>Product for MInt<M>where M:MIntBase{#[inline]fn product<I:Iterator<Item=Self>>(iter:I)->Self{iter.fold(<Self as One>::one(),Mul::mul)}}impl<'a,M:'a>Sum<&'a MInt<M>>for MInt<M>where M:MIntBase{#[inline]fn sum<I:Iterator<Item=&'a Self>>(iter:I)->Self{iter.fold(<Self as Zero>::zero(),Add::add)}}impl<'a,M:'a>Product<&'a MInt<M>>for MInt<M>where M:MIntBase{#[inline]fn product<I:Iterator<Item=&'a Self>>(iter:I)->Self{iter.fold(<Self as One>::one(),Mul::mul)}}impl<M>Display for MInt<M>where M:MIntConvert,M::Inner:Display{fn fmt<'a>(&self,f:&mut fmt::Formatter<'a>)->Result<(),fmt::Error>{write!(f,"{}",self.inner())}}impl<M>FromStr for MInt<M>where M:MIntConvert,M::Inner:FromStr{type Err=<M::Inner as FromStr>::Err;#[inline]fn from_str(s:&str)->Result<Self,Self::Err>{s.parse::<M::Inner>().map(Self::new)}}impl<M>IterScan for MInt<M>where M:MIntConvert,M::Inner:FromStr{type Output=Self;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{iter.next()?.parse::<MInt<M>>().ok()}}macro_rules!impl_mint_ref_binop{($imp:ident,$method:ident,$t:ty)=>{impl<M>$imp<$t>for&$t where M:MIntBase,{type Output=<$t as$imp<$t>>::Output;#[inline]fn$method(self,other:$t)-><$t as$imp<$t>>::Output{$imp::$method(*self,other)}}impl<M>$imp<&$t>for$t where M:MIntBase,{type Output=<$t as$imp<$t>>::Output;#[inline]fn$method(self,other:&$t)-><$t as$imp<$t>>::Output{$imp::$method(self,*other)}}impl<M>$imp<&$t>for&$t where M:MIntBase,{type Output=<$t as$imp<$t>>::Output;#[inline]fn$method(self,other:&$t)-><$t as$imp<$t>>::Output{$imp::$method(*self,*other)}}};}impl_mint_ref_binop!(Add,add,MInt<M>);impl_mint_ref_binop!(Sub,sub,MInt<M>);impl_mint_ref_binop!(Mul,mul,MInt<M>);impl_mint_ref_binop!(Div,div,MInt<M>);macro_rules!impl_mint_ref_unop{($imp:ident,$method:ident,$t:ty)=>{impl<M>$imp for&$t where M:MIntBase,{type Output=<$t as$imp>::Output;#[inline]fn$method(self)-><$t as$imp>::Output{$imp::$method(*self)}}};}impl_mint_ref_unop!(Neg,neg,MInt<M>);macro_rules!impl_mint_ref_op_assign{($imp:ident,$method:ident,$t:ty,$fromimp:ident,$frommethod:ident)=>{impl<M>$imp<$t>for$t where M:MIntBase,{#[inline]fn$method(&mut self,rhs:$t){*self=$fromimp::$frommethod(*self,rhs);}}impl<M>$imp<&$t>for$t where M:MIntBase,{#[inline]fn$method(&mut self,other:&$t){$imp::$method(self,*other);}}};}impl_mint_ref_op_assign!(AddAssign,add_assign,MInt<M>,Add,add);impl_mint_ref_op_assign!(SubAssign,sub_assign,MInt<M>,Sub,sub);impl_mint_ref_op_assign!(MulAssign,mul_assign,MInt<M>,Mul,mul);impl_mint_ref_op_assign!(DivAssign,div_assign,MInt<M>,Div,div);}