SPEED - Circular Track

no tags 

Two persons are running on a circular track either in the same direction or in the opposite direction, indefinitely. The speed of both of them is given to you. Speed will be positive in clockwise direction, and negative in anticlockwise direction. Print the number of distinct points, at which they will meet on the circle.

Input

First line contains T, number of test cases. Each test case contains two integers, S1 and S2 (not equal to zero) which are the speeds of the two persons. S1 and S2 will be distinct.

Edited: All the numbers fit in signed 32-bit integer.

Output

Print in a separate line, the number of distinct points at which they meet.

Example

Input
2
1 2
1 -1

Output
1
2

hide comments
vivek_dwivedi: 2018-07-03 07:26:08

do these type of questions when you need confidence !

raichu7: 2017-08-22 19:43:30

AC in one go :)

kooljais24: 2017-06-19 23:23:26

AC in one go....my 100th

viratian_070: 2017-06-17 16:43:18

just observe....very nice problem....

ankit1cool: 2017-06-13 15:43:49

Those getting WA check that when both s1 and s2 is negative then they are in same direction

vanvinhbk94: 2017-02-24 04:18:01

AC in one go :))

sushantoberoi3: 2016-10-31 07:04:50

good question!!

vineetpratik: 2016-07-01 17:04:03

Hint 1: you have to find distinct points at which they both meet(after some time those points keep on repeating but number of distinct points is finite)
Hint 2: gcd and relative motion can help

dwij28: 2015-12-26 01:37:21

Test cases are relatively weak. My highly UN-optimised / slow code gave 0.0 seconds..

darkhire21: 2015-10-26 19:33:00

don't mention hint in comments ...!!


Added by:Nikunj Jain
Date:2011-07-21
Time limit:0.543s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All