P7580 "RdOI R2" Sum of Divisors (sum)

monsters likes divisors, so he wants to create a problem about divisors.

As everyone knows, the standard prime factorization form of $i$ is $\prod\limits_{j=1}^{k_i} p_{i,j}^{c_{i,j}}$. Given a sequence $a$ of length $n$. Define $f(x)=\sum\limits_{d|x}\left({a_{\frac{x}{d}}\times\prod\limits_{i=1}^{k_d}{C_{c_{d,i}+m}^{m}}}\right)$. Now you need to compute $f(1),f(2),f(3),\cdots,f(n)$, where $m$ is a given constant. Since monsters does not like numbers that are too large, you need to output the answers modulo $998244353$. In addition, to avoid excessive input and output size, this problem uses a random number generator to produce the data, and you only need to output the XOR of all answers. If you do not know what $C$ is, $C_n^m=\dfrac{n!}{m!(n-m)!}$, where $!$ denotes factorial.

There is one line of input. The first line contains three non-negative integers $n,m,seed$. You need to call the data generator (```randomdigit```) $n$ times in your program to obtain $a$.

Output one line with one integer: the XOR of all $f(x)$.

**Data Generator** C/C++: ```cpp #define uint unsigned int uint seed; inline uint randomdigit(){ seed^=seed17; seed^=seed