import sys
input = sys.stdin.readline

N,B,Q=map(int,input().split())

seg_el=1<<((N+1).bit_length()) # Segment treeの台の要素数
SEG=[0]*(2*seg_el) # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化

def getvalue(n,seg_el): # 一点の値を取得
    i=n+seg_el
    ANS=SEG[i]
    i>>=1# 子ノードへ
    
    while i!=0:
        ANS+=SEG[i]
        i>>=1

    return ANS

def updates(l,r):
    L=l+seg_el
    R=r+seg_el

    while L<R:
        if L & 1:
            SEG[L]+=1
            L+=1

        if R & 1:
            R-=1
            SEG[R]+=1
        L>>=1
        R>>=1

ANS=[0]*Q

for tests in range(Q):
    L,M,R=map(int,input().split())
    updates(L,R+1)
    ANS[tests]=getvalue(M,seg_el)

LANS=[[1,1,1] for i in range(Q+1)]

for i in range(Q):
    a,b,c=LANS[i]
    na=(a+1)%B
    nb=(3*b+2*na*c)%B
    nc=3*c%B
    LANS[i+1]=[na,nb,nc]

for i in range(Q):
    print(*LANS[ANS[i]])