TLE in RECREP-RECursion challenge

Can anyone please tell why my code is giving TLE for the problem-

my solution -

My code complexity is O(T*(n+logn))

Same case for me . Watch this . This submission has 0.21 sec running time .

Same here, My all submissions here except the last one.

use scanf same was the case with me
i got accepted after using scanf