CF1674A.Number Transformation

You are given two integers $x$ and $y$. You want to choose two strictly positive (greater than zero) integers $a$ and $b$, and then apply the following operation to $x$ exactly $a$ times: replace $x$ with $b \cdot x$.

You want to find two positive integers $a$ and $b$ such that $x$ becomes equal to $y$ after this process. If there are multiple possible pairs, you can choose any of them. If there is no such pair, report it.

For example:

• if $x = 3$ and $y = 75$, you may choose $a = 2$ and $b = 5$, so that $x$ becomes equal to $3 \cdot 5 \cdot 5 = 75$;
• if $x = 100$ and $y = 100$, you may choose $a = 3$ and $b = 1$, so that $x$ becomes equal to $100 \cdot 1 \cdot 1 \cdot 1 = 100$;
• if $x = 42$ and $y = 13$, there is no answer since you cannot decrease $x$ with the given operations.

给你两个整数 $x$ 和 $y$。你需要选择两个严格为正（即大于零）的整数 $a$ 和 $b$，然后对 $x$ 恰好执行 $a$ 次如下操作：将 $x$ 替换为 $b \cdot x$。

你需要找到两个正整数 $a$ 和 $b$，使得经过该过程后 $x$ 恰好等于 $y$。如果存在多组可能的 $(a, b)$，你可以任选其一；如果不存在这样的数对，则报告无解。

例如：

• 若 $x = 3$ 且 $y = 75$，可选择 $a = 2$ 和 $b = 5$，使得 $x$ 变为 $3 \cdot 5 \cdot 5 = 75$；
• 若 $x = 100$ 且 $y = 100$，可选择 $a = 3$ 和 $b = 1$，使得 $x$ 变为 $100 \cdot 1 \cdot 1 \cdot 1 = 100$；
• 若 $x = 42$ 且 $y = 13$，则无解，因为给定的操作无法使 $x$ 减小。

The first line contains one integer $t$ ($1 \le t \le 10^4$) — the number of test cases.

Each test case consists of one line containing two integers $x$ and $y$ ($1 \le x, y \le 100$).

第一行包含一个整数 $t$（$1 \le t \le 10^4$）—— 测试用例的数量。

每个测试用例由一行组成，包含两个整数 $x$ 和 $y$（$1 \le x, y \le 100$）。

If it is possible to choose a pair of positive integers $a$ and $b$ so that $x$ becomes $y$ after the aforementioned process, print these two integers. The integers you print should be not less than $1$ and not greater than $10^9$ (it can be shown that if the answer exists, there is a pair of integers $a$ and $b$ meeting these constraints). If there are multiple such pairs, print any of them.

If it is impossible to choose a pair of integers $a$ and $b$ so that $x$ becomes $y$, print the integer $0$ twice.

如果存在一对正整数 $a$ 和 $b$，使得经过上述过程后 $x$ 变为 $y$，则输出这两个整数。你输出的整数应不小于 $1$ 且不大于 $10^9$（可以证明：若答案存在，则必存在满足这些约束的一对整数 $a$ 和 $b$）。若存在多对这样的整数，输出任意一对即可。

若不存在整数对 $a$ 和 $b$ 使得 $x$ 变为 $y$，则输出整数 $0$ 两次。