class SegTree:
    def __init__(self, op, e, n, v=None):
        self._n = n
        self._op = op
        self._e = e
        self._log = (n - 1).bit_length()
        self._size = 1 << self._log
        self._d = [self._e()] * (self._size << 1)
        if v is not None:
            for i in range(self._n):
                self._d[self._size + i] = v[i]
            for i in range(self._size - 1, 0, -1):
                self._d[i] = self._op(self._d[i << 1], self._d[i << 1 | 1])

    def set(self, p, x):
        p += self._size
        self._d[p] = x
        while p:
            l, r = p, p^1
            if l > r: l, r = r, l
            self._d[p >> 1] = self._op(self._d[l], self._d[r])
            p >>= 1

    def get(self, p):
        return self._d[p + self._size]

    #[l, r)の区間で求める
    def prod(self, l, r):
        sml, smr = self._e(), self._e()
        l += self._size
        r += self._size
        while l < r:
            if l & 1:
                sml = self._op(sml, self._d[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self._op(self._d[r], smr)
            l >>= 1
            r >>= 1
        return self._op(sml, smr)

    def all_prod(self):
        return self._d[1]

def op(x, y):
    return (x+y)

def e():
    return 0

N, B, Q = map(int, input().split())
LMR = [list(map(int, input().split())) for _ in range(Q)]
X = SegTree(op, e, N+1)
Y = SegTree(op, e, N+1)
Z = SegTree(op, e, N+1)
X.set(0, 1)
Y.set(0, 1)
Z.set(0, 1)
for l, m, r in LMR:
    X.set(l, (X.get(l)+1)%B)
    if r<N:
        X.set(r+1, (X.get(r+1)-1)%B)
    x = X.prod(0, m+1)
    #print("----", x)
    if x-1>0:
        y = pow(3, (x-1), B) * (1+2*(2+x)*(x-1)//2) % B
    else:
        y = 1
    z = pow(3, (x-1), B)
    print(x%B, y%B, z%B)