|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Delete a node from BST|
|K’th smallest element|
|Detect cycle in a directed graph|
|Element with left side smaller and right side greater|
|Sort The Array|
|Level order traversal Line by Line|
|Add two numbers represented by linked lists|
|Root to leaf path sum|
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