fn run(sc: &mut scanner::Scanner) { let n: usize = sc.next(b' '); let q: usize = sc.next(b'\n'); let a = (0..n) .map(|_| { let a: u32 = sc.next(b' '); let b: u32 = sc.next(b'\n'); Affine::new(a, b) }) .collect::>(); let seg = StaticXorSegmentTree::new(&a); let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); for _ in 0..q { let l: usize = sc.next(b' '); let r: usize = sc.next(b' '); let p: usize = sc.next(b' '); let x: u32 = sc.next(b'\n'); let ans = seg.find(l, r, p).eval(x); writeln!(out, "{}", ans).ok(); } } const MOD: u32 = 998_244_353; #[derive(Clone)] struct Affine(u32, u32); impl Affine { fn new(a: u32, b: u32) -> Self { Affine(a, b) } fn eval(&self, x: u32) -> u32 { ((self.0 as u64 * x as u64 + self.1 as u64) % MOD as u64) as u32 } } impl Monoid for Affine { fn merge(&self, rhs: &Self) -> Self { let a = self.0 as u64 * rhs.0 as u64 % MOD as u64; let b = (self.1 as u64 * rhs.0 as u64 + rhs.1 as u64) % MOD as u64; Affine::new(a as u32, b as u32) } fn e() -> Self { Affine::new(1, 0) } } pub trait Monoid: Clone { fn merge(&self, rhs: &Self) -> Self; fn e() -> Self; } pub struct StaticXorSegmentTree { data: Vec>, size: usize, } impl StaticXorSegmentTree where T: Monoid, { pub fn new(a: &[T]) -> Self { let size = a.len(); assert!(size.next_power_of_two() == size); let k = size.trailing_zeros() as usize; let mut data = Vec::with_capacity(k + 1); data.push(Vec::from(a)); for i in 1..=k { let mut a = Vec::with_capacity(size); for data in data.last().unwrap().chunks(1 << i) { let (l, r) = data.split_at(1 << (i - 1)); a.extend(l.iter().zip(r.iter()).map(|(l, r)| l.merge(r))); a.extend(l.iter().zip(r.iter()).map(|(l, r)| r.merge(l))); } data.push(a); } Self { data, size } } pub fn find(&self, mut l: usize, mut r: usize, xor: usize) -> T { assert!(l <= r && r <= self.size && xor < self.size); if l == r { return T::e(); } let mut x = T::e(); let mut y = T::e(); for (shift, data) in self.data.iter().enumerate() { if l >> shift & 1 == 1 { x = x.merge(&data[l ^ xor]); l += 1 << shift; } if r >> shift & 1 == 1 { r -= 1 << shift; y = data[r ^ xor].merge(&y); } if l == r { break; } } x.merge(&y) } } // ---------- begin Scanner(require delimiter) ---------- mod scanner { pub struct Scanner { reader: R, buf: Vec, } #[allow(dead_code)] impl Scanner { pub fn new(reader: R) -> Self { Scanner { reader: reader, buf: Vec::with_capacity(1024), } } fn read(&mut self, del: u8) { self.buf.clear(); self.reader.read_until(del, &mut self.buf).ok(); assert!(self.buf.pop().unwrap() == del); } pub fn next(&mut self, del: u8) -> T { self.read(del); std::str::from_utf8(&self.buf) .unwrap() .trim() .parse::() .ok() .unwrap() } pub fn next_bytes(&mut self, del: u8) -> Vec { self.read(del); std::str::from_utf8(&self.buf) .unwrap() .trim() .bytes() .collect() } } } // ---------- end scanner(require delimiter) ---------- use std::io::Write; fn main() { let stdin = std::io::stdin(); let mut sc = scanner::Scanner::new(stdin.lock()); run(&mut sc); }