using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    static long[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (k, n) = (c[0], c[1]);
        mod = (int)k;
        var init = new Matrix[n];
        for (var i = 0; i < n; ++i) init[i] = new Matrix(NArr(2));
        var seg = new SegmentTree<Matrix>(init, new SegOp());
        var q = NN;
        var ans = new string[q];
        for (var i = 0; i < q; ++i)
        {
            c = NList;
            var (pos, l, r) = ((int)c[0] - 1, (int)c[1] - 1, (int)c[2]);
            var y = NArr(2);
            seg[pos] = new Matrix(y);
            var ai = seg.Prod(l, r);
            ans[i] = $"{ai.A} {ai.B}\n{ai.C} {ai.D}";
        }
        WriteLine(string.Join("\n", ans));
    }
    struct Matrix
    {
        public long A;
        public long B;
        public long C;
        public long D;
        public Matrix(long a, long b, long c, long d)
        {
            A = a;
            B = b;
            C = c;
            D = d;
        }
        public Matrix(long[][] a)
        {
            A = (a[0][0] % mod + mod) % mod;
            B = (a[0][1] % mod + mod) % mod;
            C = (a[1][0] % mod + mod) % mod;
            D = (a[1][1] % mod + mod) % mod;
        }
    }
    static int mod = 1;
    struct SegOp : ISegmentTreeOperator<Matrix>
    {
        public Matrix Identity => new Matrix(1, 0, 0, 1);
        public Matrix Operate(Matrix x, Matrix y)
        {
            return new Matrix(
                (x.A * y.A + x.B * y.C) % mod,
                (x.A * y.B + x.B * y.D) % mod,
                (x.C * y.A + x.D * y.C) % mod,
                (x.C * y.B + x.D * y.D) % mod);
        }
    }

    interface ISegmentTreeOperator<T>
    {
        T Identity { get; }
        T Operate(T x, T y);
    }
    class SegmentTree<T>
    {
        int _n;
        int size;
        int log;
        T[] d;
        ISegmentTreeOperator<T> op;
        void Update(int k)
        {
            d[k] = op.Operate(d[2 * k], d[2 * k + 1]);
        }
        public SegmentTree(int n, ISegmentTreeOperator<T> op)
        {
            this.op = op;
            _n = n;
            size = 1;
            while (size < n) size <<= 1;
            log = CountRZero(size);
            d = new T[2 * size];
            for (var i = 0; i < d.Length; ++i) d[i] = op.Identity;
        }
        public SegmentTree(T[] v, ISegmentTreeOperator<T> op)
        {
            this.op = op;
            _n = v.Length;
            size = 1;
            while (size < v.Length) size <<= 1;
            log = CountRZero(size);
            d = new T[2 * size];
            for (var i = 0; i < size; ++i) d[i] = op.Identity;
            for (var i = 0; i < v.Length; ++i) d[size + i] = v[i];
            for (var i = size - 1; i >= 1; --i) Update(i);
        }
        int CountRZero(int n)
        {
            var ans = 0;
            while (n % 2 == 0)
            {
                ++ans;
                n >>= 1;
            }
            return ans;
        }
        public T this[int p]
        {
            get { return d[p + size]; }
            set
            {
                p += size;
                d[p] = value;
                for (var i = 1; i <= log; ++i) Update(p >> i);
            }
        }
        public T Prod(int l, int r)
        {
            var sml = op.Identity;
            var smr = op.Identity;
            l += size;
            r += size;
            while (l < r)
            {
                if ((l & 1) != 0) sml = op.Operate(sml, d[l++]);
                if ((r & 1) != 0) smr = op.Operate(d[--r], smr);
                l >>= 1;
                r >>= 1;
            }
            return op.Operate(sml, smr);
        }
        T AllProd() => d[1];
        int MinLeft(int r, Predicate<T> f)
        {
            if (r == 0) return 0;
            r += size;
            T sm = op.Identity;
            do
            {
                r--;
                while (r > 1 && (r % 2) != 0) r >>= 1;
                if (!f(op.Operate(d[r], sm)))
                {
                    while (r < size)
                    {
                        r = 2 * r + 1;
                        if (f(op.Operate(d[r], sm)))
                        {
                            sm = op.Operate(d[r], sm);
                            r--;
                        }
                    }
                    return r + 1 - size;
                }
                sm = op.Operate(d[r], sm);
            }
            while ((r & -r) != r);
            return 0;
        }
        public int MaxRight(int l, Predicate<T> f)
        {
            if (l == _n) return _n;
            l += size;
            T sm = op.Identity;
            do
            {
                while (l % 2 == 0) l >>= 1;
                if (!f(op.Operate(sm, d[l])))
                {
                    while (l < size)
                    {
                        l = 2 * l;
                        if (f(op.Operate(sm, d[l])))
                        {
                            sm = op.Operate(sm, d[l]);
                            ++l;
                        }
                    }
                    return l - size;
                }
                sm = op.Operate(sm, d[l]);
                ++l;
            } while ((l & -l) != l);
            return _n;
        }
    }
}