Challenges

Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 3773
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 3560
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 1824
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 2877
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 3740
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 2592
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 1897
Degree Celsius
Tom is a scientist. He uses huge machines for complex calculations. Th...
Max. Marks: 4
Solved By : 4347
Three's Company
This problem requires you to create a output string from input string ...
Max. Marks: 4
Solved By : 2901
Array Sum
You are given an integer array and you have to find the sum of the ele...
Max. Marks: 4
Solved By : 2990
Simple multiple problem
Please select a challenge
Problem Statement
You are given 2 numbers N and M. You have to find the smallest number which when multiplied to N makes it a multiple of M.

Input
First line contains T, number of test cases. Each of the next T lines contains two numbers, N and M.

Output
For each test case, print the required answer.

Constraints
1 <= T <= 100 1 <= N, M <= 10^6

Sample Input
2
4 7
18 6

Sample Output

7
1

Dcoded By: Saurav Chandra

Solved By: 977

Maximum Marks: 12