mod=998244353
def f(x,y):
  if len(x)==0:
    return y
  if len(y)==0:
    return x
  n=len(x)
  r=[(0,0) for i in range(n*2)]
  for i in range(n):
    r[i]=((x[i][0]*y[i][1]+y[i][0])%mod,x[i][1]*y[i][1]%mod)
    r[i+n]=((y[i][0]*x[i][1]+x[i][0])%mod,y[i][1]*x[i][1]%mod)
  return r

from copy import *
def init(N,node,A,unit,func):
  n=1
  while n<N:
    n<<=1
  for i in range(n*2-1):
    if len(node)<=i:
      node.append(deepcopy(unit))
    else:
      node[i]=deepcopy(unit)
  for i in range(len(A)):
    node[n-1+i]=deepcopy(A[i])
  for i in range(n-2,-1,-1):
    node[i]=func(node[(i<<1)+1],node[(i<<1)+2])
  node.append(func)
  node.append(unit)
  node.append(n)

def upd(node,x,a):
  y=node[-1]+x
  node[y-1]=a
  while y>1:
    y=y>>1
    node[y-1]=node[-3](node[(y<<1)-1],node[y<<1])

def g(x,y):
  return ((x[0]*y[1]+y[0])%mod,(x[1]*y[1])%mod)

def query(node,l,r,p):
  x,y=l,r
  z=node[-1]-1
  rr=(0,1)
  rl=(0,1)
  q=p
  while True:
    if x==y:
      return g(rl,rr)
    if x&1:
      rl=g(rl,node[(x^q)+z][p&(len(node[x+z])-1)])
      x+=1
    if y&1:
      rr=g(node[((y-1)^q)+z][p&(len(node[y+z-1])-1)],rr)
    if z==0:
      return g(rl,rr)
    x>>=1
    y>>=1
    z>>=1
    q>>=1

import sys
input=sys.stdin.buffer.readline
N,Q=map(int,input().split())
A=[]
for i in range(N):
  a,b=map(int,input().split())
  A.append([(b,a)])
seg=[]
init(N,seg,A,[],lambda x,y:f(x,y))
for i in range(Q):
  l,r,p,x=map(int,input().split())
  v=query(seg,l,r,p)
  print((v[1]*x+v[0])%mod)