Inna loves sweets very much. That's why she wants to play the "Sweet Matrix" game with Dima and Sereja. But Sereja is a large person, so the game proved small for him. Sereja suggested playing the "Large Sweet Matrix" game.

The "Large Sweet Matrix" playing field is an *n* × *m* matrix. Let's number the rows of the matrix from 1 to *n*, and the columns — from 1 to *m*. Let's denote the cell in the *i*-th row and *j*-th column as (*i*, *j*). Each cell of the matrix can contain multiple candies, initially all cells are empty. The game goes in *w* moves, during each move one of the two following events occurs:
 1.  Sereja chooses five integers *x*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">2</sub>, *v* (*x*<sub class="lower-index">1</sub> ≤ *x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">1</sub> ≤ *y*<sub class="lower-index">2</sub>) and adds *v* candies to each matrix cell (*i*, *j*) (*x*<sub class="lower-index">1</sub> ≤ *i* ≤ *x*<sub class="lower-index">2</sub>; *y*<sub class="lower-index">1</sub> ≤ *j* ≤ *y*<sub class="lower-index">2</sub>). 1.  Sereja chooses four integers *x*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">2</sub> (*x*<sub class="lower-index">1</sub> ≤ *x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">1</sub> ≤ *y*<sub class="lower-index">2</sub>). Then he asks Dima to calculate the total number of candies in cells (*i*, *j*) (*x*<sub class="lower-index">1</sub> ≤ *i* ≤ *x*<sub class="lower-index">2</sub>; *y*<sub class="lower-index">1</sub> ≤ *j* ≤ *y*<sub class="lower-index">2</sub>) and he asks Inna to calculate the total number of candies in the cells of matrix (*p*, *q*), which meet the following logical criteria: (*p* &lt; *x*<sub class="lower-index">1</sub> OR *p* &gt; *x*<sub class="lower-index">2</sub>) AND (*q* &lt; *y*<sub class="lower-index">1</sub> OR *q* &gt; *y*<sub class="lower-index">2</sub>). Finally, Sereja asks to write down the difference between the number Dima has calculated and the number Inna has calculated (D - I). 
Unfortunately, Sereja's matrix is really huge. That's why Inna and Dima aren't coping with the calculating. Help them!
The first line of the input contains three integers *n*, *m* and *w* (3 ≤ *n*, *m* ≤ 4·10<sup class="upper-index">6</sup>; 1 ≤ *w* ≤ 10<sup class="upper-index">5</sup>).

The next *w* lines describe the moves that were made in the game. 
 -  A line that describes an event of the first type contains 6 integers: 0, *x*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">2</sub> and *v* (1 ≤ *x*<sub class="lower-index">1</sub> ≤ *x*<sub class="lower-index">2</sub> ≤ *n*; 1 ≤ *y*<sub class="lower-index">1</sub> ≤ *y*<sub class="lower-index">2</sub> ≤ *m*; 1 ≤ *v* ≤ 10<sup class="upper-index">9</sup>). -  A line that describes an event of the second type contains 5 integers: 1, *x*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">2</sub> (2 ≤ *x*<sub class="lower-index">1</sub> ≤ *x*<sub class="lower-index">2</sub> ≤ *n* - 1; 2 ≤ *y*<sub class="lower-index">1</sub> ≤ *y*<sub class="lower-index">2</sub> ≤ *m* - 1). 
It is guaranteed that the second type move occurs at least once. It is guaranteed that a single operation will not add more than 10<sup class="upper-index">9</sup> candies.

Be careful, the constraints are very large, so please use optimal data structures. Max-tests will be in pretests.
print("_RANDOM_GUESS_1689178616.38235")# 1689178616.38237