B"Monocarp and Polycarp are playing a computer game. This game features n bosses for the playing to kill, numbered from 1 to n . They will fight each boss the following way: Monocarp kills the i -th boss on his a_i -th attempt. Polycarp kills the i -th boss on his b_i -th attempt. After one of them kills the i -th boss, they move on to the (i+1) -st boss. The attempt counters reset for both of them. Once one of them kills the n -th boss, the game ends. Find all values of k from 1 to n such that Monocarp kills all bosses. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of testcases. The first line of each testcase contains a single integer n ( 1 <= n <= 2 cdot 10^5 ) -- the number of bosses. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= n ) -- the index of attempt Monocarp kills each boss on. The third line contains n integers b_1, b_2, ... , b_n ( 1 <= b_i <= n ) -- the index of attempt Polycarp kills each boss on. The sum of n over all testcases doesn't exceed 2 cdot 10^5 . For each testcase, print two lines. The first line should contain a single integer mathit{cnt} -- the number of values of k from 1 to n such that Monocarp kills all bosses. The second line should contain mathit{cnt} distinct integers -- the values of k themselves. Consider the last testcase of the example. Let k = 1 . First, Monocarp makes one attempt to kill the first boss. It's successful, since a_1 = 1 . Then, Monocarp makes one attempt to kill the second boss. It's unsuccessful, since a_2 > 1 . So, Polycarp makes an attempt then. It's also unsuccessful, since b_2 > 1 . Then, Monocarp makes another attempt. It's still unsuccessful, since a_2 > 2 . This goes on until Polycarp finally kills the boss on his third attemp"...