B' 2^k teams participate in a playoff tournament. The tournament consists of 2^k - 1 games. They are held as follows: first of all, the teams are split into pairs: team 1 plays against team 2 , team 3 plays against team 4 (exactly in this order), and so on (so, 2^{k-1} games are played in that phase). When a team loses a game, it is eliminated, and each game results in elimination of one team (there are no ties). After that, only 2^{k-1} teams remain. If only one team remains, it is declared the champion; otherwise, 2^{k-2} games are played: in the first one of them, the winner of the game " 1 vs 2 " plays against the winner of the game " 3 vs 4 ", then the winner of the game " 5 vs 6 " plays against the winner of the game " 7 vs 8 ", and so on. This process repeats until only one team remains. After the tournament ends, the teams are assigned places according to the tournament phase when they were eliminated. In particular: For example, this picture describes one of the possible ways the tournament can go with k = 3 , and the resulting places of the teams: After a tournament which was conducted by the aforementioned rules ended, its results were encoded in the following way. Let p_i be the place of the i -th team in the tournament. The hash value of the tournament h is calculated as h = ( sum limits_{i=1}^{2^k} i cdot A^{p_i}) bmod 998244353 , where A is some given integer. Unfortunately, due to a system crash, almost all tournament-related data was lost. The only pieces of data that remain are the values of k , A and h . You are asked to restore the resulting placing of the teams in the tournament, if it is possible at all. The only line contains three integers k , A and h ( 1 <= k <= 5 ; 100 <= A <= 10^8 ; 0 <= h <= 998244352 ). If it is impossible to find any placing of the te'...