using System; using System.IO; using System.Linq; using System.Text; using System.Collections.Generic; using System.Diagnostics; using System.Numerics; using Enu = System.Linq.Enumerable; class Program { public void Solve() { int N = Reader.Int(), Q = Reader.Int(); var Qs = Reader.IntTable(Q); var A = new LazySegTree(N); var B = new LazySegTree(N); long scoreA = 0, scoreB = 0; foreach (var q in Qs) { int L = q[1], R = q[2] + 1; if (q[0] == 0) { int countA = A.Sum(L, R), countB = B.Sum(L, R); if (countA > countB) scoreA += countA; if (countB > countA) scoreB += countB; } else if (q[0] == 1) { A.Update(L, R, 1); B.Update(L, R, 0); } else { B.Update(L, R, 1); A.Update(L, R, 0); } } scoreA += A.Sum(0, N); scoreB += B.Sum(0, N); Console.WriteLine(scoreA + " " + scoreB); } class LazySegTree { public readonly int N; private readonly int[] RangeVal; private readonly bool[] Flag; public LazySegTree(int n) { for (N = 4; N < n; ) N *= 2; RangeVal = new int[N * 2]; Flag = new bool[N * 2]; } // [L, R) public int Sum(int L, int R) { return Sum(0, 0, N, L, R); } private int Sum(int i, int currL, int currR, int L, int R) { if (currL >= R || currR <= L) return 0; if (currR - currL == 1) return RangeVal[i]; if (currL >= L && currR <= R && Flag[i]) return RangeVal[i] * (currR - currL); if (Flag[i]) { Flag[i * 2 + 1] = Flag[i * 2 + 2] = true; RangeVal[i * 2 + 1] = RangeVal[i * 2 + 2] = RangeVal[i]; } int mid = (currL + currR) / 2; int res = Sum(i * 2 + 1, currL, mid, L, R); res += Sum(i * 2 + 2, mid, currR, L, R); return res; } // [L, R) public void Update(int L, int R, int val) { Update(0, val, 0, N, L, R); } private void Update(int i, int val, int currL, int currR, int L, int R) { if (currL >= R || currR <= L) return; if (currL >= L && currR <= R) { Flag[i] = true; RangeVal[i] = val; return; } if (Flag[i] && currR - currL > 1) { Flag[i * 2 + 1] = Flag[i * 2 + 2] = true; RangeVal[i * 2 + 1] = RangeVal[i * 2 + 2] = RangeVal[i]; Flag[i] = false; } int mid = (currL + currR) / 2; Update(i * 2 + 1, val, currL, mid, L, R); Update(i * 2 + 2, val, mid, currR, L, R); } } } class Entry { static void Main() { new Program().Solve(); } } class Reader { private static TextReader reader = Console.In; private static readonly char[] separator = { ' ' }; private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; private static string[] A = new string[0]; private static int i; private static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public static string Line() { return reader.ReadLine().Trim(); } private static string[] Split(string s) { return s.Split(separator, op); } private static string Next() { CheckNext(); return A[i++]; } private static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }