Problem Statement

Splarraay ｽﾌﾟﾗﾚｪｰｲ is a simple game that is just about painting an array.
Players are divided into Team A and Team B, and the teams compete by painting a single array with the color representing their team.
The final score is determined by the sum of the number of elements painted in that team's color and the bonus points described below, and the team with the higher score wins the game.

Rules

1. An array of length $N$, not painted in any color, is given.
2. The two teams paint intervals $[l,r]$ of the array with their team's color. If a place being painted is already colored, it is overwritten by the color painted later.
3. Bonus chances are given at irregular times. In a bonus chance, an interval $[l,r]$ is given. Let $A_{l,r}$ be the number of elements in the interval $[l,r]$ painted by Team A at that moment, and $B_{l,r}$ be the number of elements in the interval $[l,r]$ painted by Team B at that moment. The team with the larger value receives $max(A_{l,r}, B_{l,r})$ bonus points. If $A_{l,r}$ and $B_{l,r}$ are equal, neither team receives bonus points.
4. When the time limit is reached and the game ends, a team's score is the sum of the number of elements in the whole interval $[0,N-1]$ of the array painted in that team's color and the bonus points it has obtained so far.

The game has already ended, and all that remains is to calculate the scores. The history of each team's actions and the details of the bonus chances are given in chronological order, so compute the final scores.

Input

$N$
$Q$
$x$ $l$ $r$

$N$ The length of the array being painted
$Q$ The sum of the number of actions by the teams and the number of bonus chances. The details of the actions/bonus chances are given in chronological order over the following Q lines
When $x=0$, a bonus chance on the interval $[l,r]$
When $x=1$, a painting action by Team A on the interval $[l,r]$
When $x=2$, a painting action by Team B on the interval $[l,r]$

All input values are integers and satisfy the following constraints
$1\leq N \leq 100,000$
$1\leq Q \leq 100,000$
$0\leq x \leq 2$
$0\leq l \leq r \leq N-1$

Output

Output Team A's score and Team B's score separated by a space. Print a newline at the end.

チームAのスコア チームBのスコア

Sample

5
2
1 0 3
2 2 4

2 3

[-----]
[AAAA-]
[AABBB]

5
3
1 0 4
2 1 3
0 3 4

2 3

[-----]
[AAAAA]
[ABBBA]
[ABBBA] Bonus!

6
6
1 1 2
2 4 5
0 2 4
2 0 3
1 1 5
0 0 5

10 1

[------]
[-AA---]
[-AA-BB]
[-AA-BB] Bonus!
[BBBBBB]
[BAAAAA]
[BAAAAA] Bonus! A +5