B'Not so long ago, Vlad came up with an interesting function: For example, with a=3 and x=11 , the value f_3(11) = <= ft lfloor frac{11}{3} right rfloor + 11 bmod 3 = 3 + 2 = 5 . The number a is fixed and known to Vlad. Help Vlad find the maximum value of f_a(x) if x can take any integer value from l to r inclusive ( l <= x <= r ). The first line of input data contains an integer t ( 1 <= t <= 10^4 ) -- the number of input test cases. This is followed by t lines, each of which contains three integers l_i , r_i and a_i ( 1 <= l_i <= r_i <= 10^9, 1 <= a_i <= 10^9 ) -- the left and right boundaries of the segment and the fixed value of a . For each test case, output one number on a separate line -- the maximum value of the function on a given segment for a given a . In the first sample: As an answer, obviously, f_3(2) and f_3(4) are suitable. '...