CF BUDDY
← Problems·

1542B · Plus and Multiply

1500 · constructive algorithms, math, number theory

Problem: There is an infinite set generated as follows:

  • 11 is in this set.
  • If xx is in this set, xax \cdot a and x+bx+b both are in this set.

For example, when a=3a=3 and b=6b=6, the five smallest elements of the set are:

  • 11,
  • 33 (11 is in this set, so 1a=31\cdot a=3 is in this set),
  • 77 (11 is in this set, so 1+b=71+b=7 is in this set),
  • 99 (33 is in this set, so 3a=93\cdot a=9 is in this set),
  • 1313 (77 is in this set, so 7+b=137+b=13 is in this set).

Given positive integers aa, bb, nn, determine if nn is in this set.

Input Format: The input consists of multiple test cases. The first line contains an integer tt (1t1051\leq t\leq 10^5) — the number of test cases. The description of the test cases follows.

The only line describing each test case contains three integers nn, aa, bb (1n,a,b1091\leq n,a,b\leq 10^9) separated by a single space.

Output Format: For each test case, print "Yes" if nn is in this set, and "No" otherwise. You can print each letter in any case.

Note: In the first test case, 2424 is generated as follows:

  • 11 is in this set, so 33 and 66 are in this set;
  • 33 is in this set, so 99 and 88 are in this set;
  • 88 is in this set, so 2424 and 1313 are in this set.

Thus we can see 2424 is in this set.

The five smallest elements of the set in the second test case is described in statements. We can see that 1010 isn't among them.

Sample Cases

Case 1

Input

5
24 3 5
10 3 6
2345 1 4
19260817 394 485
19260817 233 264

Output

Yes
No
Yes
No
Yes

Similar problems

00:00:00
Loading editor…
Welcome! I'm your coding tutor for this problem. Use the chips below to reveal stored hints or get AI feedback on your code. I'll guide you step by step — never giving away the solution.

Sign in to unlock AI tutor feedback