B'Bethany would like to tile her bathroom. The bathroom has width w centimeters and length l centimeters. If Bethany simply used the basic tiles of size 1 x 1 centimeters, she would use w cdot l of them. However, she has something different in mind. For which values of a can Bethany tile the bathroom floor as described? Note that a can also be 1 . Each test contains multiple test cases. The first line contains an integer t ( 1 <= t <= 100 ) -- the number of test cases. The descriptions of the t test cases follow. Each test case consist of a single line, which contains two integers w , l ( 3 <= q w, l <= q 10^{9} ) -- the dimensions of the bathroom. For each test case, print an integer k ( 0 <= k ) -- the number of valid values of a for the given test case -- followed by k integers a_1, a_2, ... , a_k ( 1 <= a_i ) -- the valid values of a . The values a_1, a_2, ... , a_k have to be sorted from smallest to largest. It is guaranteed that under the problem constraints, the output contains at most 200 ,000 integers. In the first test case, the bathroom is 3 centimeters wide and 5 centimeters long. There are three values of a such that Bethany can tile the floor as described in the statement, namely a=1 , a=2 and a=3 . The three tilings are represented in the following pictures. '...