"""

f(a, b) = max(a, b)
g(a, c) = c(ただしc = 0ならばa)
g = h

f(a, b)

"""

class segtree:
    def __init__(self, n, L = None):
        self.raw_len = n
        self.list = L
        self.init()

    def init(self):
        N = 1
        n = self.raw_len
        while N < n:
            N *= 2
        self.len = N
        self.node = [(0, 0)]*(2*N-1) #fのunityに初期化
        self.lazy = [0]*(2*N-1) #gのunityに初期化
        if self.list:
            for i in range(self.raw_len):
                self.node[i+self.len-1] = self.list[i]
            for i in range(self.len - 2, -1, -1):
                self.node[i] = (self.node[2*i+1][0] + self.node[2*i+2][0], self.node[2*i+1][1] + self.node[2*i+2][1]) #f

    def update(self, i, x):#点更新
        i += self.len - 1
        self.node[i] = x
        while i > 0:
            i = (i-1)//2
            self.node[i] = (self.node[2*i+1][0] + self.node[2*i+2][0], self.node[2*i+1][1] + self.node[2*i+2][1])

    def eval(self, k, l ,r):
        if self.lazy[k] != 0:
            self.node[k] = (self.lazy[k][0] * (r-l), self.lazy[k][1] * (r-l)) #g
            if k < self.len - 1:
                self.lazy[2*k+1] = self.lazy[k]
                self.lazy[2*k+2] = self.lazy[k]
            self.lazy[k] = 0 #gのunity

    def range_update(self, a, b, x, k=0, l=0, r=None):
        if r == None:
            r =  self.len
        self.eval(k, l, r)
        if r <= a or b <= l:
            return 0
        if a <= l and r <= b:
            self.lazy[k] = x
            self.eval(k, l, r)
        else:
            self.range_update(a, b, x, k*2+1, l, (l+r)//2)
            self.range_update(a, b, x, k*2+2, (l+r)//2, r)
            self.node[k] = (self.node[2*k+1][0] + self.node[2*k+2][0], self.node[2*k+1][1] + self.node[2*k+2][1]) #f
 
    def query(self, a, b, k = 0, l = 0, r = None):
        if r == None:
            r = self.len
        if r <= a or b <= l:
            return (0, 0) #fのunity
        self.eval(k, l, r)
        if a <= l and r <= b:
            return self.node[k]
        else:
            vl = self.query(a, b, k*2+1, l, (l+r)//2)
            vr = self.query(a, b, k*2+2, (l+r)//2, r)
            return (vl[0] + vr[0], vl[1] + vr[1])
    
    def nodes(self):
        for i in range(2*self.len-1):
            self.eval(i)
        res = self.node[self.len-1:]
        return list(res)

N = int(input())
Q = int(input())
seg = segtree(N)
a_s = b_s = 0
for _ in range(Q):
    x, l, r = (int(i) for i in input().split())
    if x == 0:
        a, b = seg.query(l, r+1)
        if a > b:
            a_s += a
        elif a < b:
            b_s += b
    elif x == 1:
        seg.range_update(l, r+1, (1, 0))
    else:
        seg.range_update(l, r+1, (0, 1))
a, b = seg.query(0, N)
a_s += a
b_s += b
print(a_s, b_s)