“Uban game world” is an indoor gaming zone. It offers $5$ game segments for only one ticket. Today, Aliban is going to participate in one of the games called “Greedy Grid Game”.
This game is about an $n×m$ grid. Each cell contains an integer value $a_{i,j}$. Here $a_{i,j}$ denotes the number in the $i^{th}$ row from the top and $j^{th}$ column from the left. Aliban has to start the journey from $(1,1)$ and finish at $(n,m)$. She can’t move any cell as she pleases. There are some rules that follows -
If she starts her movement by going right, i.e., $(i,j)$ to $(i,j+1)$, then she is not allowed to stop until she reaches the border cell $(i,m)$ of the grid.
If she starts her movement by going down, i.e., $(i,j)$ to $(i+1,j)$, then she is not allowed to stop until she reaches the border $(n,j)$ cell of the grid.
She is allowed to give at most one diagonal move in her whole journey. For example, $(i,j)$ to $(i+1,j+1)$, $(i,j)$ to $(i+1,j-1)$, $(i,j)$ to $(i-1,j+1)$, $(i,j)$ to $(i-1,j-1)$.
She is not allowed to visit any cell more than once.
Except for the diagonal moves, she cannot move left or up.
She can not move outside of the grid.
The score of Aliban will be the sum of cell values she visits throughout her journey.
As Aliban is not an expert in calculation she asks for your help. You have to find the maximum score she can achieve without violating any rules.
The input consists of multiple test cases. The first line contains an integer $t (1≤t≤100)$ — the number of test cases. The description of the $t$ test cases follows.
The first line of each test case contains two positive integers $n$ and $m$$(1≤n,m≤10^5; 1≤nm≤10^5)$— the number of rows and columns respectively.
The following $n$ lines contain $m$ integers each, the $j^{th}$ element in the $i^{th}$ line holds the value $a_{i,j}$ $(-10^6≤a_{i,j}≤10^6)$.
It is guaranteed that the sum of $nm$ over all test cases does not exceed $10^5$.
For each test case, print the maximum score Aliban can achieve.
Input | Output |
---|---|
2 3 3 1 2 2 1 10 -2 2 -3 1 3 3 -1 2 3 -4 5 6 10 2 3 | 14 19 |
In the first test case, to achieve the best score her movement should be $(1,1)→(1,2)→(1,3)→(2,2)→(2,3)→(3,3)$ |