B"A rectangle with its opposite corners in (0, 0) and (w, h) and sides parallel to the axes is drawn on a plane. You are given a list of lattice points such that each point lies on a side of a rectangle but not in its corner. Also, there are at least two points on every side of a rectangle. Your task is to choose three points in such a way that: Print the doubled area of this triangle. It can be shown that the doubled area of any triangle formed by lattice points is always an integer. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of testcases. The first line of each testcase contains two integers w and h ( 3 <= w, h <= 10^6 ) -- the coordinates of the corner of a rectangle. The next two lines contain the description of the points on two horizontal sides. First, an integer k ( 2 <= k <= 2 cdot 10^5 ) -- the number of points. Then, k integers x_1 < x_2 < ... < x_k ( 0 < x_i < w ) -- the x coordinates of the points in the ascending order. The y coordinate for the first line is 0 and for the second line is h . The next two lines contain the description of the points on two vertical sides. First, an integer k ( 2 <= k <= 2 cdot 10^5 ) -- the number of points. Then, k integers y_1 < y_2 < ... < y_k ( 0 < y_i < h ) -- the y coordinates of the points in the ascending order. The x coordinate for the first line is 0 and for the second line is w . The total number of points on all sides in all testcases doesn't exceed 2 cdot 10^5 . For each testcase print a single integer -- the doubled maximum area of a triangle formed by such three points that exactly two of them belong to the same side. The points in the first testcase of the example: The largest triangle is formed by points (0, 1) , (0, 6) and (5, 4) -- its area is frac{25}{2} . Thus, the dou"...