2D Difference Array (II)

Problem Description

You are given an $n \times m$ matrix $a_{1,1}, a_{1,2}, \dots, a_{1,m}, \dots, a_{n,m}$ and $q$ update operations.

Initially all positions are $0$. Each update gives five numbers $x_1, y_1, x_2, y_2, d$ and adds $d$ to every $a_{i,j}$ with $x_1 \leq i \leq x_2$ and $y_1 \leq j \leq y_2$.

Compute the value of the whole matrix after all operations.

Input Format

The first line contains three integers $n, m, q$ ($1 \leq n, m \leq 10^9$, $q \leq 2\times 10^3$).

The next $q$ lines each contain five integers $x_1, y_1, x_2, y_2, d$ ($1 \leq x_1 \leq x_2 \leq n$, $1 \leq y_1 \leq y_2 \leq m$, $1 \leq d \leq 10^9$).

Output Format

To avoid overly large output, output the XOR sum of all numbers in the matrix after all operations.

Sample Input

5 5 3
1 1 2 3 5
2 2 4 3 6
4 3 5 5 10

Sample Output

28