给定多个包含三个整数 $p$、$q$ 和 $n$ 的问题。求 $\sum^n_{i=1}[(pi) \bmod q]$ 的值。即求 $p$ 的前 $n$ 个倍数对 $q$ 取模后的总和。注意，总和不进行取模运算。
输入的第一行包含一个整数 $W$ ($1 \leq W \leq 10^5$)，表示需要解决的测试用例数量。
接下来的 $W$ 行，每行包含三个空格分隔的整数 $p$、$q$ 和 $n$ ($1\leq p, q, n \leq 10^6$)，即上述问题的参数。
输出 $W$ 行，每行对应一个问题的答案，顺序与输入顺序一致。
3
2 7 2
1 4 5
3 8 106
7
37The 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: