Problem G: Hippity Hopscotch
The game of hopscotch involves chalk, sidewalks, jumping, and picking things
up. Our variant of hopscotch involves money as well. The game is played
on a square grid of dimension n: each grid location is labelled (p,q) where
0 <= p < n and 0 <= q < n. Each grid location has on it a stack of between
0 and 100 pennies.
A contestant begins by standing at location (0,0). The contestant collects
the money where he or she stands and then jumps either horizontally or
vertically to another square. That square must be within the jumping
capability of the contestant (say, k locations) and must have more
pennies than those that were on the current square.
Given n, k, and the number of pennies at each grid location, compute the
maximum number of pennies that the contestant can pick up before being
unable to move.
First line of the input contains integer T - the number of test cases. Each test case consists of following:
- a line containing two integers between 1 and 100: n and k
- n lines, each with n numbers: the first line contains the number
of pennies at locations (0,0) (0,1) ... (0,n-1); the next line
contains the number of pennies at locations (1,0), (1,1), ... (1,n-1),
and so on.
- For each test case print an integer on a line giving the number of pennies collected
1 2 5
10 11 6
12 12 7
Output for Sample Input