class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n

    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)

    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def get_size(self, x):
        x = self.find(x)
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x


N, B, Q = map(int, input().split())
T = Fenwick_Tree(N + 1)
ans = [(1, 1, 1)]
for i in range(Q):
    x, y, z = ans[-1]
    nx = x + 1
    ny = 3 * y + 2 * nx * z
    nz = 3 * z
    ans.append((nx%B, ny%B, nz%B))
    
for _ in range(Q):
    L, M, R = map(int, input().split())
    L -= 1
    T.add(L, 1)
    T.add(R, -1)
    print(*ans[T.sum(0, M)])