#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int s[N][N];
int main()
{
int T;
cin >> T;
while(T -- )
{
int n, m;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i ++ )
for(int j = 1; j <= m; j ++ )
{
int x;
scanf("%d", &x);
s[i][j] = max(s[i - 1][j], s[i][j - 1]) + x;
}
cout << s[n][m] << endl;
}
}