Dima and the Table#2943
Dima received a special table of size n \times m as a gift from his mother. This table allows Dima to perform a unique operation: he can choose three numbers — , , and (1 \leq i \leq n, 1 \leq j \leq m, -1000 \leq d \leq 1000) — and add to the element located at . As Dima plays with the table, his mother sometimes asks for the sum of the elements whose indices satisfy from\_row \leq row \leq to\_row and from\_column \leq column \leq to\_column. Dima easily answers these questions. Can you do the same?
The first line contains three integers , , and (1 \leq n, m \leq 1000, 1 \leq q \leq 10^5) — the number of rows and columns in the table, and the total number of operations and queries.
The next lines each contain integers, each with absolute value not exceeding — the initial state of the table.
The next lines describe the operations and queries. The first character of each line can be + or ?. If the line starts with +, it is an addition operation, followed by , , and , whose constraints are described above. If the line starts with ?, it is a query, followed by from\_row, to\_row, from\_column, to\_column (1 \leq from\_row \leq to\_row \leq n, 1 \leq from\_column \leq to\_column \leq m).
Print the answer to each query, one per line.
مثال 1