摘花生
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 10;
int t;
int r,c;
int g[N][N],f[N][N];
int main(){
cin >> t;
while(t--){
memset(f,0,sizeof(f));
cin >> r >> c;
for(int i = 1; i <= r; i++){
for(int j = 1; j <= c; j++){
cin >> g[i][j];
}
}
f[1][1] = g[1][1];
for(int i = 1; i <= r; i++){
for(int j = 1; j <= c; j++){
g[i][j] += max(g[i][j - 1], g[i - 1][j]);//往上和左边进行扩展
}
}
cout << g[r][c] << endl;
}
return 0;
}