设 $f(a, b, m)$ 为同余方程的最小非负整数解：
$$ax \equiv b \pmod{m}$$
若该方程无解，则 $f(a, b, m) = 0$。
给定 $n, a, b$，计算 $\sum_{i=1}^{n} f(a, b, i) \pmod{998244353}$。
第一行包含一个整数 $T$ ($1 \le T \le 5$)，表示测试用例的数量。
接下来 $T$ 行，每行包含三个正整数 $n, a, b$ ($1 \le n \le 10^{18}, 1 \le a, b \le 10^6$)。
输出 $T$ 行。第 $i$ 行包含第 $i$ 个测试用例的答案。
5 5 4 3 5 3 4 10 5 8 10 8 5 100 79 97
2 3 15 10 2519
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: