|All-time Popular Problems|
|Delete without head pointer|
|Check if a number is power of another number|
|Array to BST|
|Implement Queue using Linked List|
|Lowest Common Ancestor in a BST|
|Reverse a Linked List in groups of given size.|
|Print all nodes that don’t have sibling|
|Equal to product|
Consider circular track with n points marked as 1, 2, …n. A person is initially placed on point k. The person moves m > 0, slot forward (in circular way) in each step. Find the minimum number of steps required so that the person reaches initial point k.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains integers n,k,m.
Print the minimum number of steps required so that the person reaches initial point k.
9 2 6
6 3 2
Explanation: In the first test case, Sequence of moves is 2 => 8 => 5 => 2.So total number of moves are 3.