/************************************
Note Book:
************************************/
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <math.h>
#define LL long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
int a[105][105];
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 >> a[i][j];
			}
		}
		for(int i = 1; i <= n; i++)
		{
			for(int j = 1; j <= m; j++)
			{
				a[i][j] += max(a[i-1][j] , a[i][j-1]);
			}
		}
		cout << a[n][m] << endl;
	}
	return 0;
}