#include<iostream>
#include<algorithm>
using namespace std;
int T,i,j,n,m,w[105][105],f[105][105];
int main()
{
scanf("%d",&T);
while(T--){
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)for(j=1;j<=m;j++)scanf("%d",&w[i][j]);
for(i=1;i<=n;i++)for(j=1;j<=m;j++)f[i][j]=max(f[i-1][j],f[i][j-1])+w[i][j];
printf("%d\n",f[n][m]);
}
return 0;
}