import sys
input = sys.stdin.readline


class FenwickTree:
    def __init__(self, size):
        self.data = [0] * (size + 1)
        self.size = size

    # i is exclusive
    def prefix_sum(self, i):
        s = 0
        while i > 0:
            s += self.data[i]
            i -= i & -i
        return s

    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.data[i] += x
            i += i & -i


N, B, Q = map(int, input().split())
ft = FenwickTree(N+1)
x = y = z = 1
val = [(1, 1, 1)]
for _ in range(Q):
    x += 1
    y = 3*y+2*x*z
    z = 3*z
    x %= B
    y %= B
    z %= B
    val.append((x, y, z))
for _ in range(Q):
    L, M, R = map(int, input().split())
    L -= 1
    ft.add(L, 1)
    ft.add(R, -1)
    x = ft.prefix_sum(M)
    print(*val[x])