**Compilation/Execution Result:**

Given a rectangle of dimensions a X b find the minimum number (n) of identical squares of maximum side that can be cut out from that rectangle so that no residue remains in the rectangle. Also find the dimension k of that square.

**Input:**

The first line of the input contains an integer 'T' denoting the number of testcases. Then T test cases follow. Each test case consits of a single line containing two space separated integers a and b denoting the dimensions of the rectangle.

**Output:**

For each test case print n and k (space separated ) in a new line.

**Constraints:**

1<=T<=30

1<=a,b<=10^9

**Example:**

**INPUT:**

3

2 4

3 6

2 8

**OUTPUT:**

2 2

2 3

4 2

Author: Mukesh Kumar 5

Pulkit Gupta 2 | 130 |

Relentless | 124 |

Ibrahim Nash | 94 |

nancygarg258_pec | 90 |

darkswordsman | 90 |

Ibrahim Nash | 602 |

KartikAgarwal | 541 |

rs119574 | 371 |

surbhi_7 | 356 |

Little Noah | 335 |

akhayrutdinov | 4261 |

sanjay05 | 3633 |

Ibrahim Nash | 3162 |

Quandray | 3028 |

Michael Riegger | 2359 |