B'The score of a sequence [s_1, s_2, ldots, s_d] is defined as displaystyle frac{s_1 cdot s_2 cdot ldots cdot s_d}{d!} , where d!=1 cdot 2 cdot ldots cdot d . In particular, the score of an empty sequence is 1 . For a sequence [s_1, s_2, ldots, s_d] , let m be the maximum score among all its subsequences. Its cost is defined as the maximum length of a subsequence with a score of m . You are given a non-decreasing sequence [a_1, a_2, ldots, a_n] of integers of length n . In other words, the condition a_1 <= q a_2 <= q ldots <= q a_n is satisfied. For each k=1, 2, ldots , n , find the cost of the sequence [a_1, a_2, ldots , a_k] . A sequence x is a subsequence of a sequence y if x can be obtained from y by deletion of several (possibly, zero or all) elements. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). The description of the test cases follows. The first line of each test case contains an integer n ( 1 <= n <= 10^5 ) -- the length of the given sequence. The second line of each test case contains n integers a_1,a_2, ldots,a_n ( 1 <= a_i <= q n ) -- the given sequence. It is guaranteed that its elements are in non-decreasing order. It is guaranteed that the sum of n over all test cases does not exceed 5 cdot 10^5 . For each test case, output n integers -- the costs of sequences [a_1, a_2, ldots , a_k] in ascending order of k . In the first test case: '...