You're given three integers , and .You can do the following operation:
Pick an integer z>1 and multiply by , i.e. x := x \cdot z
Determine if you can make equal to after doing the previous operation exactly times.
The first line consists of a single integer (1 \le t \le 500)the number of testcases.
Each testcase consists of three integers , and (1 \le x,y \le 10^5 , 0 \le k \le 10^5).
For each testcase, output "YES" (without quotes) if you can make equal to in exactly operations, and "NO" (without quotes) otherwise.
You can output the answer in any case (For example, the strings "yEs", "yes", "Yes", and "YeS" will be recognized as positive responses).
Example 1
Subtask ( points): No additional constraints