B"Rahul and Tina are looking forward to starting their new year at college. As they enter their new classroom, they observe the seats of students are arranged in a n x m grid. The seat in row r and column c is denoted by (r, c) , and the distance between two seats (a,b) and (c,d) is |a-c| + |b-d| . As the class president, Tina has access to exactly k buckets of pink paint. The following process occurs. Rahul wants to choose a seat such that he sits as close to Tina as possible. However, Tina wants to sit as far away from Rahul as possible due to some complicated relationship history that we couldn't fit into the statement! Now, Rahul wonders for k = 0, 1, ... , n cdot m - 1 , if Tina has k buckets of paint, how close can Rahul sit to Tina, if both Rahul and Tina are aware of each other's intentions and they both act as strategically as possible? Please help satisfy Rahul's curiosity! The input consists of multiple test cases. The first line contains an integer t ( 1 <= q t <= q 5 cdot 10^4 ) -- the number of test cases. The description of the test cases follows. The first line of each test case contains two integers n , m ( 2 <= q n cdot m <= q 10^5 ) -- the number of rows and columns of seats in the classroom. The sum of n cdot m across all test cases does not exceed 10^5 . For each test case, output n cdot m ordered integers -- the distance between Rahul and Tina if both of them act optimally for every k in [0, n cdot m - 1] . One possible sequence of choices for the first testcase where Tina has k=3 buckets of paints is as follows. Tina paints the seats at positions (1, 2) , (2, 2) , (3, 2) with pink paint. Rahul chooses the seat at (3, 1) after which Tina chooses to sit at (1, 3) . Therefore, the distance between Tina and Rahul is |3-1| + |1-3| = 4 , and we can prove that this is indeed the m"...