Given two values ‘a’ and ‘b’ that represent coefficients in “ax – by = 0”, find the smallest values of x and y that satisfy the equation. It may also be assumed that x > 0, y > 0, a > 0 and b > 0.

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integers a and b.

**Output:**

Print the value of x and y repectively with a space between them. Print the answer for each test case in a new line.

**Constraints:**

1<= T <=100

1<= a, b <=1000

**Example:**

**Input:**

1

25 35

**Output:**

7 5

Author: sujnesh

TheRagnarok | 107 |

Abhay Raghav | 80 |

TS006 | 78 |

rajpratim Bhattachar | 71 |

PriyaGupta6 | 70 |

skirmish | 420 |

Mithun Kumar | 404 |

???151 | 401 |

Deepanshu8391 | 391 |

ultra_instinct | 369 |

akhayrutdinov | 4748 |

Quandray | 3922 |

sanjay05 | 3668 |

Ibrahim Nash | 3664 |

surbhi_7 | 2816 |