Chef and Matrix Division

Chef has n × n array A of non-negative integers. He wants to divide this array by p-1 horizontal dividers and p-1 vertical dividers into p2 blocks such that maximum sum of elements of each block will be the smallest. More formally, Chef want to choose p-1 horizontal dividers 0 = h0 h1 hp = n and p-1 vertical dividers 0 = v0 v1 vp = n to minimize the next value: Input - The first line of each te