#101Easy

Row sums

Time: 1 s · Memory: 256 MB

Statement

You are given an $m \times n$ matrix. Find the sum of the elements of each row.

The first line contains $m$ and $n$ ( $1 \le m, n \le 100$ ). Each of the next $m$ lines contains $n$ integers ( $|a_{ij}| \le 10^9$ ).

$m$ lines: the $i$ -th line contains the sum of row $i$ .

Input

Output

6
15
24

Input

2 2
-1 1
5 -9

Output

0
-4

You do not have to store the whole matrix: read a row and print its sum right away. The sum reaches $10^{11}$ — long long / int64.

Row sums

Time: 1 s · Memory: 256 MB

Matrices

You are given an $m \times n$ matrix. Find the sum of the elements of each row.

The first line contains $m$ and $n$ ( $1 \le m, n \le 100$ ). Each of the next $m$ lines contains $n$ integers ( $|a_{ij}| \le 10^9$ ).

$m$ lines: the $i$ -th line contains the sum of row $i$ .

Input

Output

6
15
24

Input

2 2
-1 1
5 -9

Output

0
-4

You do not have to store the whole matrix: read a row and print its sum right away. The sum reaches $10^{11}$ — long long / int64.