P7513 "Stoi2031" Lantingxu (Enhanced Version).

This problem is an enhanced version of ["Stoi2031" Lantingxu](https://www.luogu.com.cn/problem/P7487).

Given $n=a^b$ and $k$, for each $1 \le t \le k$, compute $$\prod_{x_1=1}^{n}\prod_{x_2=1}^{n}\dots\prod_{x_t=1}^{n}\left( 1+e^{\frac{2\pi ix_1x_2\dots x_t}{n}} \right) \bmod{335544323}$$ Output the bitwise XOR of all $k$ answers. Here, $e^{it}=\cos{t}+i\sin{t}$ holds for all $t \in \mathbb{R}$. $i$ is the imaginary unit, satisfying $i^2=-1$.

One line with three positive integers $a,b,k$, where $n=a^b$.

One line with one non-negative integer representing the answer.

Constraints: For all testdata, $1 \le a \le 10^{18}$, $1 \le b \le 10^{13}$, $1 \le k \le 10^5$. Translated by ChatGPT 5