Again the sum (of functions)

Input

The first line contains three integers $n$, $m$, and $g$ (1 \le n, m \le 100, 1 \le g \le 2) — the dimensions of the field and the block number.

Each of the following $n$ lines contains $m$ integers a_{i1}, a_{i2}, \ldots, a_{im} (1 \le a_{ij} \le 10^9) — the numbers in the field.

Interaction

You need to implement the following function:

integer solve(integer n, integer m, integer g)

• $n$ and $m$ — the dimensions of the field;

• $g$ — the block number;

• The function should return a single integer — the sum of all numbers in the field.

To query cell values, you should use the function:

integer getValue(integer x, integer y)

• $x$ (1 \le x \le n) — row number;

• $y$ (1 \le y \le m) — column number;

• The function returns the value written in cell $(x,y)$.

Output

Output a single integer — the sum of all numbers in the field.

Examples

Scoring

1. ($30$ points): n \le 1;

2. ($70$ points): no additional constraints.