CF390E Inna and Large Sweet Matrix

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_{1},y_{1},x_{2},y_{2},v $ $ (x_{1}

The first line of the input contains three integers $ n $ , $ m $ and $ w $ $ (3

For each second type move print a single integer on a single line — the difference between Dima and Inna's numbers.

Note to the sample. After the first query the matrix looks as: `

22200

22200

00000

00000

`After the second one it is: `

22200

25500

03300

00000

`After the third one it is: `

22201

25501

03301

00001

`For the fourth query, Dima's sum equals 5 + 0 + 3 + 0 = 8 and Inna's sum equals 4 + 1 + 0 + 1 = 6. The answer to the query equals 8 - 6 = 2. For the fifth query, Dima's sum equals 0 and Inna's sum equals 18 + 2 + 0 + 1 = 21. The answer to the query is 0 - 21 = -21.