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.

**Input:**

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.

**Output:**

Print the minimum number of steps required so that the person reaches initial point k.

**Constraints:**

1<=T<=10^5

1<=n<=10^5

1<=m<=10^5

1<=k<=n

**Example:
Input:**

2

9 2 6

6 3 2

**Output:**

3

3

**Explanation: **In the first test case, Sequence of moves is 2 => 8 => 5 => 2.So total number of moves are 3.

All Is Well | 176 |

Srinivas Chakravarth | 142 |

ioan | 131 |

praveen2809 | 116 |

Diplav Srivastava | 105 |

Lam Ngoc Pham | 405 |

All Is Well | 365 |

Divvya Sinha | 356 |

skull tone | 310 |

Prateek Gole | 309 |

akhayrutdinov | 3805 |

sanjay05 | 3366 |

Michael Riegger | 2014 |

Jasleen Kaur 2 | 2012 |

Quandray | 1933 |