#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <queue>
#include <stack>
#include <algorithm>
const int N = 1e6 + 10;
using namespace std;
int t, n, m, dp[110][110], ans;
int read() {
    char ch = getchar();
    int f = 1, num = 0;

    while (ch < '0' || ch > '9') {
        if (ch == '-')
            f = -1;

        ch = getchar();
    }

    while (ch >= '0' && ch <= '9') {
        num = num * 10 + ch - '0';
        ch = getchar();
    }

    return num * f;
}
int main() {
    t = read();

    while (t--) {
        n = read(), m = read();

        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + read();

        printf("%d\n", dp[n][m]);
    }
}