import random

class Segtree:
	def __init__(self):
		self.N = 2 ** 17
		self.dat = [0] * (self.N * 2)
		self.lazy = [-1] * (self.N * 2)

	def setLazy(self, k, v, s):
		self.dat[k] = v * s
		self.lazy[k] = v

	def push(self, k, s):
		if self.lazy[k] != -1:
			self.setLazy(k * 2 + 0, self.lazy[k], s // 2)
			self.setLazy(k * 2 + 1, self.lazy[k], s // 2)
			self.lazy[k] = -1

	def recFill(self, ql, qr, v, k, nl, nr):
		if ql <= nl and nr <= qr:
			self.setLazy(k, v, nr - nl)
		else:
			nm = (nl + nr) // 2
			self.push(k, nr - nl)
			if ql < nm:
				self.recFill(ql, qr, v, k * 2 + 0, nl, nm)
			if qr > nm:
				self.recFill(ql, qr, v, k * 2 + 1, nm, nr)
			self.dat[k] = self.dat[k * 2] + self.dat[k * 2 + 1]

	def fill(self, ql, qr, v):
		self.recFill(ql, qr, v, 1, 0, self.N)

	def recSum(self, ql, qr, k, nl, nr):
		if nr <= ql or qr <= nl: return 0
		if ql <= nl and nr <= qr: return self.dat[k]
		self.push(k, nr - nl)
		nm = (nl + nr) // 2
		vl = self.recSum(ql, qr, k * 2 + 0, nl, nm)
		vr = self.recSum(ql, qr, k * 2 + 1, nm, nr)
		return vl + vr

	def summ(self, ql, qr):
		return self.recSum(ql, qr, 1, 0, self.N)

N = int(input())
Q = int(input())

segA = Segtree()
segB = Segtree()

scoreA = 0
scoreB = 0

for _ in range(Q):
	x, l, r = map(int, input().split())

	if x == 0:
		a = segA.summ(l, r + 1)
		b = segB.summ(l, r + 1)
		if a > b: scoreA += a
		if a < b: scoreB += b
	elif x == 1:
		segA.fill(l, r + 1, 1)
		segB.fill(l, r + 1, 0)
	else:
		segA.fill(l, r + 1, 0)
		segB.fill(l, r + 1, 1)

scoreA += segA.summ(0, N)
scoreB += segB.summ(0, N)

print(scoreA, scoreB)