定义 $f(x)$ 为满足 $1 \leq y \leq x$ 且 $\gcd(x,y)=1$ 的整数 $y$ 的个数。这里 $\gcd(x,y)$ 是 $x$ 和 $y$ 的最大公约数。
定义 $g(x) = k \cdot f(x)$。
定义 $g^{(t)}(x)=g(g^{(t-1)}(x))$ 当 $t>1$ 时，且 $g^{(1)}(x)=g(x)$。
求 $g^{(t)}(n) \bmod 998\,244\,353$。
一行包含三个整数 $n,k,t$（$1 \leq n,k,t \leq 998\,244\,352$）。
输出一个整数，表示答案对 $998\,244\,353$ 取模的结果。
5 3 4
12
114514 1919 810
565299374
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: