#include <iostream>
#include <algorithm>

using namespace std;

const int N = 110;

int w[N][N];
int f[N][N];

int main(){

    int T;
    cin >> T;

    while(T--){
        int n,m;
        cin >> n >> m;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                cin >> w[i][j];
            }
        }
        //开始DP
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                f[i][j] = max(f[i-1][j],f[i][j-1])+ w[i][j];
            }
        }

        cout << f[n][m] << endl;
    }

    return 0;
}