Subtractions

1000ms

262144K

Description:

You've got two numbers. As long as they are both larger than zero, they go through the same operation: subtract the lesser number from the larger one. If they equal substract one number from the another. For example, one operation transforms pair (4,17) to pair (4,13), it transforms (5,5) to (0,5).

You've got some number of pairs (a_i, b_i). How many operations will be performed for each of them?

Input:

The first line contains the number of pairs n (1 ≤ n ≤ 1000). Then follow n lines, each line contains a pair of positive integers a_i, b_i (1 ≤ a_i, b_i ≤ 10⁹).

Output:

Print the sought number of operations for each pair on a single line.

Sample Input:

2
4 17
7 987654321

Sample Output:

8
141093479

Informação

Provedor Codeforces

Código CF267A