Attacked squares

Mirko likes chess and programming. Ordinary chess bored him quickly, so he came up with a game that uses only rooks.

He found a chessboard with $N$ rows and $N$ columns and placed $K$ rooks on it.

The rules are:

1. Every rook has a power, given as one integer.
2. A rook sees every square of its own row and its own column, except the square it stands on.
3. A square is attacked if the binary XOR of the powers of all rooks that see it is greater than $0$.

A square that holds a rook can be attacked as well.

Mirko starts from the initial layout and makes $P$ moves. After each move, find how many squares are attacked.

A rook can be moved to any free square of the board. The move is not restricted to its own row or column.

The first line contains the integers $N$, $K$, $P$ ($1 \le N \le 10^9$, $1 \le K \le 10^5$, $1 \le P \le 10^5$).

Each of the next $K$ lines contains three integers $R$, $C$, $X$ ($1 \le R, C \le N$, $1 \le X \le 10^9$), meaning that a rook of power $X$ starts on square $(R, C)$.

Each of the next $P$ lines contains four integers $R_1$, $C_1$, $R_2$, $C_2$ ($1 \le R_1, C_1, R_2, C_2 \le N$), meaning that a rook moved from square $(R_1, C_1)$ to square $(R_2, C_2)$.

No two rooks stand on the same square at any point.

Print $P$ lines. Line $k$ contains the number of attacked squares after the $k$th move.

An explanation of the first example. After the first move every square of the board is attacked. Square $(1, 1)$, for instance, is seen by one rook only, so the XOR for that square is $1$. After the second move no square is attacked. Square $(1, 1)$ is seen by both rooks, and the XOR of their powers is $0$.