def op(x, y):
    return x+y
class SegTree:
    def __init__(self, init_val, op, ide_ele):
        n = len(init_val)
        self.n = n
        self.op = op
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        for i in range(n):
            self.tree[self.num + i] = init_val[i]

    def update(self, l, r, x):
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                self.tree[l] = self.op(x, self.tree[l])
                l += 1
            if r & 1:
                self.tree[r - 1] = self.op(x, self.tree[r - 1])
            l >>= 1
            r >>= 1

    def query(self, k):
        ans = self.ide_ele
        k += self.num
        ans = self.op(ans, self.tree[k])
        while k > 1:
            ans = self.op(ans, self.tree[k>>1])
            k >>= 1
        return ans

N, B, Q = map(int, input().split())
query = [list(map(int, input().split())) for _ in range(Q)]

A = [[1%B]*3 for _ in range(Q+1)]
for i in range(1, Q+1):
    A[i][0] = (A[i-1][0]+1)%B
    A[i][1] = (3*A[i-1][1]+2*A[i][0]*A[i-1][2])%B
    A[i][2] = A[i-1][2]*3%B

seg = SegTree([0]*N, op, 0)
for L, M, R in query:
    L, M, R = L-1, M-1, R-1
    seg.update(L, R+1, 1)
    print(*A[seg.query(M)])