#include<cstdio>

#include<iostream>

#include<algorithm>

#include<cstdlib>

#include<cstring>

using namespace std;

const int maxn=1010;

int T,n,m;

int f[maxn][maxn];

int map[maxn][maxn];

void cmax(int &a,int b){if(a<b)a=b;return;}

void read(int &num){

    num=0;char ch=getchar();

    while(ch<'!')ch=getchar();

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

}

int main(){

    read(T);

    while(T--){

        read(n);read(m);

        for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)read(map[i][j]);

        memset(f,0,sizeof(f));

        for(int i=n;i>=1;--i){

            for(int j=1;j<=m;++j){

                cmax(f[i][j],f[i+1][j]);

                cmax(f[i][j],f[i][j-1]);

                cmax(f[i][j],f[i+1][j-1]+map[i][j]);

            }

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

    }return 0;

}