python3 简单DP
T = int(input())
def a(r, c):
w = []
f = [[0 for i in range(c+1)] for j in range(r+1)]
for i in range(r):
x = input()
x1 = [int(i) for i in x.split()]
w.append(x1)
for i in range(1, r+1):
for j in range(1, c+1):
f[i][j] = max(f[i][j-1], f[i-1][j]) + w[i-1][j-1]
return f[i][j]
for i in range(T):
r, c = map(int, input().split())
print(a(r, c))