Given two integers ‘a’ and ‘m’, find modular multiplicative inverse of ‘a’ under modulo ‘m’.

Input: a = 3, m = 11

Output: 4

Since (4*3) mod 11 = 1, 4 is modulo inverse of 3

One might think, 15 also as a valid output as "(15*3) mod 11"

is also 1, but 15 is not in ring {0, 1, 2, ... 10}, so not valid.

**Note:** Print the smallest modular multiplicative inverse

**Input:**

First line consists of T test cases. Only line of every test case consists of 2 integers 'a' and 'm'.

**Output:**

Print the modular multiplicative inverse if exists else print -1.

**Constraints:**

1<=T<=100

1<=M<=100

1<=A<=M

**Example:
Input:**

2

3 11

10 17

4

12

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 |