Challenges

Bitwise for Dummies
This is to provide you with an introductory experience of bit-wise ope...
Max. Marks: 6
Solved By : 825
Double the Number
Given an array A of size N and K. count all the number of elements suc...
Max. Marks: 8
Solved By : 918
Rotate Array
You are given an array of N length. You have to rotate the array right...
Max. Marks: 6
Solved By : 1931
Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 5585
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 4387
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 2537
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 3958
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 4567
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 3131
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 2372
Simple multiple problem
loading...
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: 1376

Maximum Marks: 12