19138번 - GCD vs LCM 다국어

문제

bobo is good at GCD (greatest common divisor) and LCM (least common multiple).

But today he gets stuck in summing up $\mathrm{lcm}(i, j)$ for all 1ドル \leq i \leq n, 1 \leq j \leq m$ with $\gcd(i, j) \leq a,ドル modulo $(10^9 + 7)$.

입력

The first line contains an integer $q,ドル which denotes the number of questions (1ドル \leq q \leq 10^4$).

Each of the following $q$ lines contains 3ドル$ integers $n, m, a,ドル as described in the statement (1ドル \leq n, m, a \leq 10^5$).

출력

For each question, print a single integer denoting the sum.

제한

힌트