HDU 2571 dp

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t0 = sc.nextInt();
        int[][] a = new int[25][1005];
        int[][] dp = new int[25][1005];
        while(t0-->=0) {
            int n = sc.nextInt();
            int m = sc.nextInt();
            for(int i=0;i<25;i++) {
                Arrays.fill(a[i], 0);
                Arrays.fill(dp[i],0);
            }
            for(int i=1;i<=n;i++)
                for(int j=1;j<=m;j++)
                    a[i][j] = sc.nextInt();
            for(int i=1;i<=n;i++)
                dp[i][0] = Integer.MIN_VALUE;
            for(int j=1;j<=m;j++)
                dp[0][j] = Integer.MIN_VALUE;
            dp[0][1] = dp[1][0] = 0;
            int mx;
            for(int i=1;i<=n;i++) {
                for(int j=1;j<=m;j++) {
                    mx = Integer.MIN_VALUE;
                    for(int t=2;t<=j;t++) {
                        if(j%t==0)
                            mx = Math.max(dp[i-1][j],Math.max(mx, dp[i][j/t]));
                    }
                    mx = Math.max(dp[i-1][j], Math.max(dp[i][j-1], mx));
                    dp[i][j] = mx+a[i][j];
                }
            }
            System.out.println(dp[n][m]);
        }
    }
}