hdu 2571

#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define REP(i,a,b) for (i=(a);i<=(b);i++)
#define CLEAR(a) memset((a),0,sizeof((a)))

using namespace std;

typedef long long LL;
const double pi = acos(-1.0);
const int maxn = 2e3, maxm = 30;
const int inf = 99999999;

int mp[maxm][maxn], dp[maxm][maxn];
int n, m;

void init();
void solve();
void outp();

int main()
{
    int T;
    while (~scanf("%d", &T))
        while (T--)
        {
            init();
            solve();
            outp();
        }
    return 0;
}

void solve()
{
    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]);
            for (int k = 2; k <= m; k++)
            {
                if (j / k == (float)j / k) //存在倍数关系
                {
                    dp[i][j] = max(dp[i][j], dp[i][j / k]);
                }
            }
            dp[i][j] += mp[i][j];
        }
    }
}
void init()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            cin >> mp[i][j];
        }
    for (int i = 0; i <= n; i++)
    {
        dp[i][0] = -inf;
    }
    for (int i = 0; i <= m; i++)
    {
        dp[0][i] = -inf;
    }
    dp[1][0] = dp[0][1] = 0;
}

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