B"The snails are climbing a tree. The tree height is h meters, and snails start at position 0 . Each snail has two attributes a and b ( a > b ). Starting from the 1 -st day, one snail climbs the tree like this: during the daylight hours of the day, he climbs up a meters; during the night, the snail rests, and he slides down b meters. If on the n -th day, the snail reaches position h for the first time (that is, the top of the tree), he will finish climbing, and we say that the snail spends n days climbing the tree. Note that on the last day of climbing, the snail doesn't necessarily climb up a meters, in case his distance to the top is smaller than a . Unfortunately, you don't know the exact tree height h at first, but you know that h is a positive integer. There are q events of two kinds. You need to deal with all the events in order. Each test contains multiple test cases. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. Then follows their description. The first line of each test case contains one integer q ( 1 <= q <= 2 cdot 10^5 ) -- the number of events. For the following q lines, the first integer of each line is either 1 or 2 , denoting the event type. If the event type is 1 , then three integers a , b , and n ( 1 <= a,b,n <= 10^9 , a>b ) follow. If the event type is 2 , then two integers a and b ( 1 <= a,b <= 10^9 , a>b ) follow. It is guaranteed that the sum of q over all test cases does not exceed 2 cdot 10^5 . For each test case, output q integers in one line, one for each event, in order. Specifically, In the first test case, we can determine h=7 through the first message, so we know the second snail and the third snail need to spend 2 and 5 days respectively to reach the top. Let's "...