Forest dwellers

Forest dwellers, known to you from the problem "Play hockey real...", finally held their planned hockey tournament in a round-robin format; that is, each team played every other team exactly once. As is often the case in the early stages of competitions, fans were dissatisfied with the refereeing of every match, so for each match, a new referee was assigned from among the same fans. Both the fans and the players were all inhabitants of the forest. Players, regardless of whether they participated in a particular game, could not be appointed as referees for any match, as they were considered interested parties. The total number of forest dwellers is $k$, and each of the $n$ teams consists of $m$ players. If it was not possible to assign a new referee for the next match, such a match was recognized as a draw. In all played matches, there were no draws at all, because in this extreme case, the winner is determined at the end of the meeting during a shoot-out series.

You need to find the number of decisive matches and the number of matches recognized as draws in the hockey tournament held by the forest dwellers.