Divide and Conquer

Given two integers M and N, with 1 ≤ M ≤ N ≤ 5000, you must determine the integer numbers X and Y such that

• A. M ≤ X ≤ N; and
• B. Y is the number of divisors of X; and
• C. Y is the largest possible; and
• D. X is the largest possible.

Your program should process several test cases. Each test case is composed by a single line contain- ing the two integers M and N (1 ≤ M ≤ N ≤ 5000). The end of input is indicated by M = N = 0.

The input must be read from standard input.

For each test case in the input your program should print a single line, containing the two integers X and Y, separated by a space character.

The output must be written to standard output.