# import pypyjit # pypyjit.set_param("max_unroll_recursion=-1") from collections import * from functools import * from itertools import * from heapq import * import sys, math,random,time # input = sys.stdin.readline class XorSegmentTree: def __init__(self, A, f, E): self.N = len(A) self.ST = [[] for _ in range(self.N * 2 - 1)] self.f = f self.E = E for i in range(self.N): self.ST[self.N - 1 + i].append(A[i]) for i in range(self.N - 2, -1, -1): cnt = len(self.ST[i * 2 + 1]) for j in range(cnt): self.ST[i].append(f(self.ST[i * 2 + 1][j], self.ST[i * 2 + 2][j])) for j in range(cnt): self.ST[i].append(f(self.ST[i * 2 + 2][j], self.ST[i * 2 + 1][j])) def _range_fold(self, L, R, x, i=0, l=0, r=None): if r is None: r = self.N if r <= L or R <= l: return self.E elif L <= l and r <= R: assert x < len(self.ST[i]) return self.ST[i][x] else: p = (r - l) // 2 m = (l + r) // 2 if (x & p) == 0: resL = self._range_fold(L, R, x, i * 2 + 1, l, m) resR = self._range_fold(L, R, x, i * 2 + 2, m, r) return self.f(resL, resR) else: resL = self.E if R >= m: resL = self._range_fold(max(L, m) - p, R - p, x ^ p, i * 2 + 1, l, m) resR = self.E if L < m: resR = self._range_fold(L + p, min(R, m) + p, x ^ p, i * 2 + 2, m, r) return self.f(resR, resL) def range_fold(self, L, R, x): return self._range_fold(L, R, x, 0, 0, self.N) N,Q = map(int,input().split()) mod = 998244353 def segfunc(y,x): return (x[0]*y[0]%mod,(x[0]*y[1]+x[1])%mod) ide_ele = (1,0) X = [] for _ in range(N): X.append(tuple(map(int,input().split()))) T = XorSegmentTree(X,segfunc,ide_ele) for _ in range(Q): l,r,p,x = map(int,input().split()) a,b = T.range_fold(l,r,p) print((a*x+b)%mod)