문제<\/h2>
Julia wants to create a new board game for $n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> players. As part of the game, players decide the order of their turns. The game should be fair: every possible permutation of players should be chosen with the same probability.<\/p> To help players determine this permutation, Julia wants to create n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> different k<\/mi><\/mrow>k<\/math><\/span><\/span> k<\/span><\/span><\/span><\/span>-sided dice. Each player will throw their own dice and look at the number. The player with the smallest number will go first, the player with the second smallest number will go second, and so on. To make sure no ties could happen, all numbers used on all dice should be distinct.<\/p> That could be a good math problem, but this is a programming contest, so we allow some imprecision. We ask you to create the dice for this game, but the probabilities of obtaining the permutations may differ slightly. Your solution will be accepted if the relative difference of probabilities of any two permutations is no more than 0.2\%.<\/p> Formally, there are k<\/mi>n<\/mi><\/msup><\/mrow>k^n<\/math><\/span><\/span> k<\/span> <\/span> n<\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span><\/span> different outcomes of throwing all$

Joking?