**#include #include using namespace std;

const int maxn = 100+10; int dp[maxn][maxn];

int main() { int t; int r,c; cin >> t; while(t--) { memset(dp,0,sizeof(dp)); cin >> r >> c; for(int i = 1;i <= r;++i) for(int j = 1;j <= c;++j) cin >> dp[i][j];

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

}**