P10315 [SHUPC 2024] Genshin Impact, Start!

Electro elemental totems have the following properties: 1. Each totem has $m$ states, one of $0,1,\cdots,m-1$. 2. When a totem is attacked once, it moves to the next state (the next state of $m-1$ is $0$). 3. When a certain totem is attacked once, it will also cause some other totems to move to the next state together. When the states of all $n$ totems are the same, the puzzle is solved. However, player A thinks the totem puzzles in the game are too easy: he can solve them by using Keqing’s “Zhan Jin Niu Za” to attack all the totems randomly once, so he starts thinking about a more complex version. Now there are $n$ Electro elemental totems, and each totem has $m$ states. For each totem $i$, when it is attacked, there are $k_i$ other totems that will move to the next state together with it. Given the initial state $s$ and the target state $t$ of the $n$ Electro elemental totems, compute how many times you need to attack each totem in order to transform the totems from state $s$ to $t$. If there is no solution, output `niuza`.

The first line contains two positive integers $n,m\ (1\le n\le100,m\le10^9)$. It is **guaranteed that $m$ is prime**. In the next $n$ lines, line $i$ contains the following data: - First read an integer $k\ (0\le k

If there is a solution, output $n$ integers each less than $m$, representing how many times you should attack each totem. Separate them with spaces. If there are multiple solutions, output any one of them. If there is no solution, output `niuza`.

Translated by ChatGPT 5