#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 110;

int T;
int R,C;
int f[N][N];
int w[N][N];

int main(void)
{
    cin>>T;
    while(T--)
    {
        cin>>R>>C;
        for(int i = 1 ; i<=R ;i++)
            for(int j = 1 ; j<=C ;j++)
            cin>>w[i][j];

        memset(f, 0, sizeof f);
        for(int i = 1 ; i<=R ;i++)
            for(int j = 1 ; j<=C ;j++)
        f[i][j] = max(f[i - 1][j], f[i][j - 1]) + w[i][j];

        cout<<f[R][C]<<endl;
    }
    return 0;
}