class BIT:
    def __init__(self, n):
        self.size = n
        self.tree = [0]*(n+1)
 
    def build(self, list):
        self.tree[1:] = list.copy()
        for i in range(self.size+1):
            j = i + (i & (-i))
            if j < self.size+1:
                self.tree[j] += self.tree[i]

    def sum(self, i):
        # [0, i) の要素の総和を返す
        s = 0
        while i>0:
            s += self.tree[i]
            i -= i & -i
        return s
    # 0 index を 1 index に変更  転倒数を求めるなら1を足していく
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i



n,b,q = map(int,input().split())

XYZ = [1,1,1]
query = [[1%b,1%b,1%b]]
for i in range(q+1):
    XYZ[0] += 1
    XYZ[1] = 3 * XYZ[1] + 2*XYZ[0]*XYZ[2]
    XYZ[2] *= 3
    XYZ[0] %= b
    XYZ[1] %= b
    XYZ[2] %= b
    query.append(XYZ[:])

# print(query)

bit = BIT(n+5)
for _ in range(q):
    l,m,r = map(int,input().split())
    bit.add(l,1)
    bit.add(r+1,-1)
    num = bit.sum(m+1)

    print(*query[num])