#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
template <typename T>
struct segment_tree{
  int N;
  vector<vector<T>> ST;
  function<T(T, T)> f;
  T E;
  segment_tree(vector<T> &A, function<T(T, T)> f, T E): f(f), E(E){
    N = A.size();
    ST = vector<vector<T>>(N * 2 - 1);
    for (int i = 0; i < N; i++){
      ST[N - 1 + i].push_back(A[i]);
    }
    for (int i = N - 2; i >= 0; i--){
      int cnt = ST[i * 2 + 1].size();
      for (int j = 0; j < cnt; j++){
        ST[i].push_back(f(ST[i * 2 + 1][j], ST[i * 2 + 2][j]));
      }
      for (int j = 0; j < cnt; j++){
        ST[i].push_back(f(ST[i * 2 + 2][j], ST[i * 2 + 1][j]));
      }
    }
  }
  T range_fold(int L, int R, int x, int i, int l, int r){
    if (r <= L || R <= l){
      return E;
    } else if (L <= l && r <= R){
      assert(x < ST[i].size());
      return ST[i][x];
    } else {
      int p = (r - l) / 2;
      int m = (l + r) / 2;
      if ((x & p) == 0){
        T resL = range_fold(L, R, x, i * 2 + 1, l, m);
        T resR = range_fold(L, R, x, i * 2 + 2, m, r);
        return f(resL, resR);
      } else {
        T resL = E;
        if (R >= m){
          resL = range_fold(max(L, m) - p, R - p, x ^ p, i * 2 + 1, l, m);
        }
        T resR = E;
        if (L < m){
          resR = range_fold(L + p, min(R, m) + p, x ^ p, i * 2 + 2, m, r);
        }
        return f(resR, resL);
      }
    }
  }
  T range_fold(int L, int R, int x){
    return range_fold(L, R, x, 0, 0, N);
  }
};
struct linear{
  long long a, b;
  linear(){
    a = 1;
    b = 0;
  }
  linear(int a, int b): a(a), b(b){
  }
};
linear composite(linear A, linear B){
  return linear(A.a * B.a % MOD, (A.b * B.a + B.b) % MOD);
}
int value(linear A, int x){
  return (A.a * x + A.b) % MOD;
}
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N, Q;
  cin >> N >> Q;
  assert(1 <= N && N <= (1 << 18));
  assert(__builtin_popcount(N) == 1);
  assert(1 <= Q && Q <= 200000);
  vector<linear> f(N);
  for (int i = 0; i < N; i++){
    int a, b;
    cin >> a >> b;
    assert(1 <= a && a < MOD);
    assert(0 <= b && b < MOD);
    f[i] = linear(a, b);
  }
  segment_tree<linear> F(f, composite, linear());
  for (int i = 0; i < Q; i++){
    int l, r, p, x;
    cin >> l >> r >> p >> x;
    assert(0 <= l && l < r && r <= N);
    assert(0 <= p && p < N);
    assert(0 <= x && x < MOD);
    cout << value(F.range_fold(l, r, p), x) << "\n";
  }
}