Reach fast

Chef is standing at coordinate $A$ while Chefina is standing at coordinate $B$. In one step, Chef can increase or decrease his coordinate by **at most** $K$. Determine the **minimum** number of steps required by Chef to reach Chefina. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of three integers $A, B,$ and