1284：摘花生《信息学奥赛一本通》

/*
1284：摘花生《信息学奥赛一本通》 
http://ybt.ssoier.cn:8088/problem_show.php?pid=1284
*/

#include <iostream>
using namespace std;

int field[101][101], dp[101][101];
int main()
{
    int t;
    cin >> t;

    while (t--)
    {
        int r, c;
        cin >> r >> c;

        for (int i = 1; i <= r; i++)
            for (int j = 1; j <= c; j++)
                cin >> field[i][j];
        
        dp[1][1] = field[1][1];
        for (int i = 1; i <= r; i++)
            for (int j = 1; j <= c; j++)
            {
                dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]) + field[i][j];
            }
        
        cout << dp[r][c] << endl;
    }
    
    return 0;
}