|All-time Popular Problems|
|Find duplicates in an array|
|Triplet Sum in Array|
|Sorting Elements of an Array by Frequency|
|Search an Element in an array|
|Diameter of Binary Tree|
|Maximum of all subarrays of size k|
|Leaders in an array|
|Find median in a stream|
|Reverse a Linked List in groups of given size.|
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.
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.
Print the value of x and y repectively with a space between them. Print the answer for each test case in a new line.
1<= T <=100
1<= a, b <=1000