Each test consists of several test cases. The first line contains one integer $t$ ($1 \le t \le 100$)~--- the number of test cases. The description of the test cases follows.

The first line of each test case contains two integers $n$ and $m$ ($1 \le n \le 3$, $1 \le m \le 100\,000$)~--- the number of rows and columns in the table, respectively.

The next $n$ lines describe the initial number of residents in the houses. The $i$-th line contains $m$ integers $a_{(i, 1)}, a_{(i, 2)}, \ldots a_{(i, m)}$ ($0 \le a_{(i, j)} \le 10^9$)~--- the initial number of people in each house.

The following $n$ lines describe the number of residents in the houses after the move. The $i$-th line contains $m$ integers $b_{(i, 1)}, b_{(i, 2)}, \ldots b_{(i, m)}$ ($0 \le b_{(i, j)} \le 10^9$)~--- the number of people in each house after the move.

It is guaranteed that the sum of the values $a_{(i, j)}$ equals the sum of the values $b_{(i, j)}$.

Let $M$ be the sum of $m$ over all test cases. It is guaranteed that $M$ does not exceed $100\,000$.