One of the secret chambers in Hogwarts is full of philosopher’s stones. The floor of the chamber is covered by h × w square tiles, where there are h rows of tiles from front (first row) to back (last row) and w columns of tiles from left to right. Each tile has 1 to 100 stones on it. Harry has to grab as many philosopher’s stones as possible, subject to the following restrictions:

• He starts by choosing any tile in the first row, and collects the philosopher’s stones on that tile. Then, he moves to a tile in the next row, collects the philosopher’s stones on the tile, and so on until he reaches the last row.
• When he moves from one tile to a tile in the next row, he can only move to the tile just below it or diagonally to the left or right.

Given the values of h and w, and the number of philosopher’s stones on each tile, write a program to compute the maximum possible number of philosopher’s stones Harry can grab in one single trip from the first row to the last row.

Input

The first line consists of a single integer T, the number of test cases. In each of the test cases, the first line has two integers. The first integer h (1 <= h <= 100) is the number of rows of tiles on the floor. The second integer w (1 <= w <= 100) is the number of columns of tiles on the floor. Next, there are h lines of inputs. The i-th line of these, specifies the number of philosopher’s stones in each tile of the i-th row from the front. Each line has w integers, where each integer m (0 <= m <= 100) is the number of philosopher’s stones on that tile. The integers are separated by a space character.

Output

The output should consist of T lines, (1 <= T <= 100), one for each test case. Each line consists of a single integer, which is the maximum possible number of philosopher’s stones Harry can grab, in one single trip from the first row to the last row for the corresponding test case.

Example

Input:
1
6 5
3 1 7 4 2
2 1 3 1 1
1 2 2 1 8
2 2 1 5 3
2 1 4 4 4
5 2 7 5 1

Output:
32 	

//7+1+8+5+4+7=32

---

hide comments

< Previous 18 19 20 21 22 23 24 25 26 27 28 Next >
	Sudarshan K: 2014-02-06 15:14:01 could someone tell me how do i take input here? are there w integers on each line.?I am getting wa even with correct logic.
	Sumit Kumar Kisku: 2014-02-02 11:46:24 my first dp :)
	Praneeth : 2014-01-27 09:18:03 First Dp :)
	785227: 2014-01-16 15:08:17 My 150th Classical :)
	shashank: 2014-01-16 11:30:48 AC in C++ , but nzec in java... I don't know what's the problem with java... most of the time i got nzec in java ... but the same logic in python or c++ or c .. AC :(
	warlock: 2014-01-12 11:54:35 easy dp, weak test cases!
	Amitrajit Chattopadhyay: 2014-01-03 08:35:07 yaahoo!!right answer in first try!!my first dp problem :)
	Rodney Ledo Ramírez: 2013-09-18 01:36:46 Please i need some tricky test cases, i test mi solution and seems to be correct but i getting WA
	(Tjandra Satria Gunawan)(曾毅昆): 2013-08-21 05:12:32 Input formatting is very bad.. need a lot of submissions to get it properly. And finally #3 best solver ;-)
	Nabil: 2013-07-14 09:18:05 I had no idea it was DP... I just got accepted on the first time :D nice problem