#include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; template struct MInt { unsigned int v; constexpr MInt() : v(0) {} MInt(const long long x) : v(x >= 0 ? x % mod() : x % mod() + mod()) {} static constexpr MInt raw(const int x) { MInt x_; x_.v = x; return x_; } static int get_mod() { return mod(); } static void set_mod(const unsigned int divisor) { mod() = divisor; } static void init(const int x) { inv(x); fact(x); fact_inv(x); } template static MInt inv(const int n) { // assert(0 <= n && n < mod() && std::gcd(x, mod()) == 1); static std::vector inverse{0, 1}; const int prev = inverse.size(); if (n < prev) return inverse[n]; if constexpr (MEMOIZES) { // "n!" and "M" must be disjoint. inverse.resize(n + 1); for (int i = prev; i <= n; ++i) { inverse[i] = -inverse[mod() % i] * raw(mod() / i); } return inverse[n]; } int u = 1, v = 0; for (unsigned int a = n, b = mod(); b;) { const unsigned int q = a / b; std::swap(a -= q * b, b); std::swap(u -= q * v, v); } return u; } static MInt fact(const int n) { static std::vector factorial{1}; if (const int prev = factorial.size(); n >= prev) { factorial.resize(n + 1); for (int i = prev; i <= n; ++i) { factorial[i] = factorial[i - 1] * i; } } return factorial[n]; } static MInt fact_inv(const int n) { static std::vector f_inv{1}; if (const int prev = f_inv.size(); n >= prev) { f_inv.resize(n + 1); f_inv[n] = inv(fact(n).v); for (int i = n; i > prev; --i) { f_inv[i - 1] = f_inv[i] * i; } } return f_inv[n]; } static MInt nCk(const int n, const int k) { if (n < 0 || n < k || k < 0) [[unlikely]] return MInt(); return fact(n) * (n - k < k ? fact_inv(k) * fact_inv(n - k) : fact_inv(n - k) * fact_inv(k)); } static MInt nPk(const int n, const int k) { return n < 0 || n < k || k < 0 ? MInt() : fact(n) * fact_inv(n - k); } static MInt nHk(const int n, const int k) { return n < 0 || k < 0 ? MInt() : (k == 0 ? 1 : nCk(n + k - 1, k)); } static MInt large_nCk(long long n, const int k) { if (n < 0 || n < k || k < 0) [[unlikely]] return MInt(); inv(k); MInt res = 1; for (int i = 1; i <= k; ++i) { res *= inv(i) * n--; } return res; } MInt pow(long long exponent) const { MInt res = 1, tmp = *this; for (; exponent > 0; exponent >>= 1) { if (exponent & 1) res *= tmp; tmp *= tmp; } return res; } MInt& operator+=(const MInt& x) { if ((v += x.v) >= mod()) v -= mod(); return *this; } MInt& operator-=(const MInt& x) { if ((v += mod() - x.v) >= mod()) v -= mod(); return *this; } MInt& operator*=(const MInt& x) { v = (unsigned long long){v} * x.v % mod(); return *this; } MInt& operator/=(const MInt& x) { return *this *= inv(x.v); } auto operator<=>(const MInt& x) const = default; MInt& operator++() { if (++v == mod()) [[unlikely]] v = 0; return *this; } MInt operator++(int) { const MInt res = *this; ++*this; return res; } MInt& operator--() { v = (v == 0 ? mod() - 1 : v - 1); return *this; } MInt operator--(int) { const MInt res = *this; --*this; return res; } MInt operator+() const { return *this; } MInt operator-() const { return raw(v ? mod() - v : 0); } MInt operator+(const MInt& x) const { return MInt(*this) += x; } MInt operator-(const MInt& x) const { return MInt(*this) -= x; } MInt operator*(const MInt& x) const { return MInt(*this) *= x; } MInt operator/(const MInt& x) const { return MInt(*this) /= x; } friend std::ostream& operator<<(std::ostream& os, const MInt& x) { return os << x.v; } friend std::istream& operator>>(std::istream& is, MInt& x) { long long v; is >> v; x = MInt(v); return is; } private: static unsigned int& mod() { static unsigned int divisor = 0; return divisor; } }; template requires requires { typename T::Monoid; {T::id()} -> std::same_as; {T::merge(std::declval(), std::declval())} -> std::same_as; } struct SegmentTree { using Monoid = typename T::Monoid; explicit SegmentTree(const int n) : SegmentTree(std::vector(n, T::id())) {} explicit SegmentTree(const std::vector& a) : n(a.size()), p2(std::bit_ceil(a.size())) { dat.assign(p2 << 1, T::id()); std::copy(a.begin(), a.end(), dat.begin() + p2); for (int i = p2 - 1; i > 0; --i) { dat[i] = T::merge(dat[i << 1], dat[(i << 1) + 1]); } } void set(int idx, const Monoid val) { idx += p2; dat[idx] = val; while (idx >>= 1) dat[idx] = T::merge(dat[idx << 1], dat[(idx << 1) + 1]); } Monoid get(int left, int right) const { Monoid res_l = T::id(), res_r = T::id(); for (left += p2, right += p2; left < right; left >>= 1, right >>= 1) { if (left & 1) res_l = T::merge(res_l, dat[left++]); if (right & 1) res_r = T::merge(dat[--right], res_r); } return T::merge(res_l, res_r); } Monoid operator[](const int idx) const { return dat[idx + p2]; } template int find_right(int left, const G g) const { if (left >= n) [[unlikely]] return n; Monoid val = T::id(); left += p2; do { while (!(left & 1)) left >>= 1; Monoid nxt = T::merge(val, dat[left]); if (!g(nxt)) { while (left < p2) { left <<= 1; nxt = T::merge(val, dat[left]); if (g(nxt)) { val = nxt; ++left; } } return left - p2; } val = nxt; ++left; } while (!std::has_single_bit(static_cast(left))); return n; } template int find_left(int right, const G g) const { if (right <= 0) [[unlikely]] return -1; Monoid val = T::id(); right += p2; do { --right; while (right > 1 && (right & 1)) right >>= 1; Monoid nxt = T::merge(dat[right], val); if (!g(nxt)) { while (right < p2) { right = (right << 1) + 1; nxt = T::merge(dat[right], val); if (g(nxt)) { val = nxt; --right; } } return right - p2; } val = nxt; } while (!std::has_single_bit(static_cast(right))); return -1; } private: const int n, p2; std::vector dat; }; namespace monoid { template struct RangeMinimumQuery { using Monoid = T; static constexpr Monoid id() { return std::numeric_limits::max(); } static Monoid merge(const Monoid& a, const Monoid& b) { return std::min(a, b); } }; template struct RangeMaximumQuery { using Monoid = T; static constexpr Monoid id() { return std::numeric_limits::lowest(); } static Monoid merge(const Monoid& a, const Monoid& b) { return std::max(a, b); } }; template struct RangeSumQuery { using Monoid = T; static constexpr Monoid id() { return 0; } static Monoid merge(const Monoid& a, const Monoid& b) { return a + b; } }; } // namespace monoid int main() { using ModInt = MInt<0>; struct S { using Monoid = array, 2>; static Monoid id() { return {1, 0, 0, 1}; } static Monoid merge(const Monoid& a, const Monoid& b) { Monoid res{}; for (int i = 0; i < 2; ++i) { for (int k = 0; k < 2; ++k) { for (int j = 0; j < 2; ++j) { res[i][j] += b[i][k] * a[k][j]; } } } return res; } }; int n, b, q; cin >> n >> b >> q; ModInt::set_mod(b); SegmentTree a(n); REP(i, n) { S::Monoid a_i{}; REP(r, 2) REP(c, 2) cin >> a_i[r][c]; a.set(i, a_i); } while (q--) { int l, r; ModInt x, y; cin >> l >> r >> x >> y; --l; --r; const auto matrix = a.get(l + 1, r + 1); // REP(i, 2) REP(j, 2) cout << matrix[i][j] << " \n"[j + 1 == 2]; cout << matrix[0][0] * x + matrix[0][1] * y << ' ' << matrix[1][0] * x + matrix[1][1] * y << '\n'; } return 0; }