Division Problem
Submissions: 222   Accuracy:

36.48%

  Difficulty: Easy   Marks: 2

You will be given two positive integers A and N and you have to find the smallest positive integer x such that N divides Ax - 1.

 

Input:
The first line of input contains a single integer T denoting the number of test cases.
Then T test cases follow. The first and only line of each test case consists of two space separated positive integers denoting A and N.

 

Output:
Corresponding to each test case, in a new line, print the smallest positive number x such that N divides Ax - 1. If it is not possible to find such a number x, then print -1.

 

Constraints:
1 ≤ T ≤ 100
1 ≤ N,A ≤ 10000

Example:

Input
3
10 8
7 16
5 18

Output
-1
7
11

** For More Input/Output Examples Use 'Expected Output' option **

Author: Hemang Sarkar


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.