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

Mr_Bean | 512 |

Dhirendra121 | 353 |

ashu_tech | 181 |

RishabhTanwar1 | 156 |

cds91 | 137 |

Mr_Bean | 651 |

Dhirendra121 | 458 |

kevinyu102589 | 358 |

kinetic | 339 |

舒义然 | 312 |

akhayrutdinov | 4920 |

Ibrahim Nash | 4444 |

Quandray | 4261 |

sanjay05 | 3668 |

GB11 | 2857 |

Login to report an issue on this page.