B"You're at the last mission in one very old and very popular strategy game Dune II: Battle For Arrakis. The map of the mission can be represented as a rectangular matrix of size n x m . Initially, there are a_{i, j} units of your army in the cell (i, j) . You want to prepare for the final battle, so you want to move all your army into exactly one cell of the map (i.e. nm-1 cells should contain 0 units of the army and the remaining cell should contain the entire army). To do this, you can do some (possibly, zero) number of moves. During one move, you can select exactly one unit from some cell and move it to one of the adjacent by side cells. I.e. from the cell (i, j) you can move the unit to cells: Of course, you want to move all your army into exactly one cell as fast as possible. So, you want to know the minimum number of moves you need to do that. And, of course, life goes on, so the situation on the map changes. There are q updates, the i -th update is denoted by three integers x, y, z . This update affects the army in the cell (x, y) : after this update, the number of units in the cell (x, y) becomes z (i.e. you replace a_{x, y} with z ). Also, you want to determine, for each i , the minimum number of moves needed to move your entire army into exactly one cell with the first i updates applied to the initial map. In other words, the map after the i -th update equals the initial map with the first i updates applied to it. The first line of the input contains three integers n, m and q ( 1 <= n, m <= 1000; 1 <= q <= 5000 ) -- the size of the matrix and the number of updates correspondingly. The next n lines contain m integers each, where the j -th integer in the i -th line is a_{i, j} ( 1 <= a_{i, j} <= 10^9 ) -- the number of units in the cell (i, j) . The next q lines contain three in"...