pub trait SortD{ fn sort_d(&mut self); } impl SortD for Vec{ fn sort_d(&mut self) { self.sort_by(|u, v| v.cmp(&u)); } } pub trait Mx{fn max(&self, rhs: Self)->Self;} impl Mx for f64{ fn max(&self, rhs: Self)->Self{if *self < rhs{ rhs } else { *self } }} pub trait Mi{ fn min(&self, rhs: Self)->Self; } impl Mi for f64{ fn min(&self, rhs: Self)->Self{ if *self > rhs{ rhs } else { *self } } } pub fn gcd(mut a: i64, mut b: i64)->i64{ if b==0{return a;}(a,b)=(a.abs(),b.abs());while b!=0{ let c = a;a = b;b = c%b; }a } pub fn factorial_i64(n: usize)->(Vec, Vec){ let mut res = vec![1; n+1];let mut inv = vec![1; n+1];for i in 0..n{ res[i+1] = (res[i]*(i+1)as i64)%MOD; }inv[n] = mod_inverse(res[n], MOD);for i in (0..n).rev(){ inv[i] = inv[i+1]*(i+1) as i64%MOD; }(res, inv) } pub fn floor(a:i64, b:i64)->i64{let res=(a%b+b)%b;(a-res)/b} pub fn extended_gcd(a:i64,b:i64)->(i64,i64,i64) {if b==0{(a,1,0)}else{let(g,x,y)=extended_gcd(b,a%b);(g,y,x-floor(a,b)*y)}} pub fn mod_inverse(a:i64,m:i64)->i64{let(_,x,_) =extended_gcd(a,m);(x%m+m)%m} pub fn comb(a: i64, b: i64, f: &Vec<(i64, i64)>)->i64{ if aVec<(i64, i64)>{ let mut f=vec![(1i64,1i64),(1, 1)];let mut z = 1i64; let mut inv = vec![0; x as usize+10];inv[1] = 1; for i in 2..x+1{z=(z*i)%MOD; let w=(MOD-inv[(MOD%i)as usize]*(MOD/i)%MOD)%MOD; inv[i as usize] = w; f.push((z, (f[i as usize-1].1*w)%MOD));}return f;} pub fn fast_mod_pow(x: i64,p: usize, m: i64)->i64{ let mut res=1;let mut t=x;let mut z=p;while z > 0{ if z%2==1{res = (res*t)%m;}t = (t*t)%m;z /= 2; }res} pub fn vec_out(v: Vec) where T: ToString{ println!("{}", v.iter().map(|x| x.to_string()).collect::>().join(" ")); } pub fn one_add_out(v: Vec){println!("{}", v.iter().map(|x| (x+1).to_string()).collect::>().join(" "));} pub trait Chmax{ fn chmax(&mut self, rhs: Self); } impl Chmax for i64{ fn chmax(&mut self, rhs: Self) { *self = (*self).max(rhs) } } impl Chmax for i32{ fn chmax(&mut self, rhs: Self) { *self = (*self).max(rhs) } } impl Chmax for f64{ fn chmax(&mut self, rhs: Self) { *self = (*self).max(rhs) } } impl Chmax for usize{ fn chmax(&mut self, rhs: Self) { *self = (*self).max(rhs) } } pub trait Chmin { fn chmin(&mut self, rhs: Self); } impl Chmin for i64{ fn chmin(&mut self, rhs: Self) { *self = (*self).min(rhs) } } impl Chmin for i32{ fn chmin(&mut self, rhs: Self) { *self = (*self).min(rhs) } } impl Chmin for f64{ fn chmin(&mut self, rhs: Self) { *self = (*self).min(rhs) } } impl Chmin for usize{ fn chmin(&mut self, rhs: Self) { *self = (*self).min(rhs) } } #[allow(unused_imports)] use std::{ convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,}, fs::{File}, hash::{Hash, Hasher, BuildHasherDefault}, iter::{Product, Sum}, marker::PhantomData, ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds}, str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once}, collections::{*, btree_set::Range, btree_map::Range as BTreeRange}, mem::{swap}, cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd}, thread::LocalKey, f64::consts::PI, time::Instant, cell::RefCell, io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write}, }; #[allow(unused_imports)] use proconio::{input, input_interactive, marker::{*}, fastout}; /* #[allow(unused_imports)] use rustc_hash::FxHasher; #[allow(dead_code)] type FxMap = HashMap>; #[allow(dead_code)] type FxSet = HashSet>; #[allow(unused_imports)] use rand::{thread_rng, Rng, seq::SliceRandom, prelude::*}; #[allow(unused_imports)] use itertools::{Itertools}; #[allow(unused_imports)] use ordered_float::OrderedFloat; #[allow(unused_imports)] use ac_library::{*, ModInt998244353 as mint}; #[allow(dead_code)] type MI = StaticModInt;pub fn factorial_mint(n: usize)->(Vec, Vec){ let mut res = vec![mint::new(1); n+1];let mut inv = vec![mint::new(1); n+1];for i in 0..n{res[i+1] = res[i]*(i+1);}inv[n] = mint::new(1)/res[n];for i in (0..n).rev(){inv[i] = inv[i+1]*(i+1);}(res, inv)} */ #[allow(dead_code)] const INF: i64 = 1<<60; #[allow(dead_code)] const MOD: i64 = 998244353; #[allow(dead_code)] const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)]; #[allow(dead_code)] const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)]; #[fastout] fn main() { input! { n: usize, m: usize, k: usize, mut a: [usize; n], } if m==1{ for v in a{ if v%k==0{ println!("1"); } else { println!("0"); } } return; } else if m==n{ let mut dp = vec![0; k]; dp[0] = 1; for &v in &a{ let mut ndp = dp.clone(); for j in 0..k{ ndp[(j+v)%k] += dp[j]; } dp = ndp; } println!("{}", (dp[0]+MOD-1)%MOD); return; } while a.len()%m > 0{ a.push(0); } let mut cnt = 0; for i in 0..n/m{ let mut dp = vec![0; k]; dp[0] = 1; let mut right = vec![dp.clone()]; for j in (0..m).rev(){ let v = a[i*m+j]; let mut ndp = dp.clone(); for (r, &x) in dp.iter().enumerate(){ ndp[(r+v)%k] += x; } dp = ndp; right.push(dp.clone()); } dp = vec![0; k]; dp[0] = 1; for j in 0..m{ if cnt <= n-m{ let mut res = MOD-1; for r in 0..k{ res = (res+right[m-j][r]*dp[(k-r)%k])%MOD; } println!("{}", res); cnt += 1; } let v = a[(i+1)*m+j]; let mut ndp = dp.clone(); for (r, &x) in dp.iter().enumerate(){ ndp[(r+v)%k] += x; } dp = ndp; } } }