Farmer John's (n) cows are playing a card game! Farmer John has a deck of (n \cdot m) cards numbered from (0) to (n \cdot m-1). He distributes (m) cards to each of his (n) cows. Farmer John wants the game to be fair, so each cow should only be able to play (1) card per round. He decides to determine a turn order , determined by a permutation(^{\text{∗}}) (p) of length (n), such that the (p_i)'th cow will be the (i)'th cow to place a card on top of the center pile in a round. In other words, the following events happen in order in each round: The (p_1)'th cow places any card from their deck on top of the center pile. The (p_2)'th cow places any card from their deck on top of the center pile. ... The (p_n)'th cow places any card from their deck on top of the center pile. There is a catch. Initially, the center pile contains a card numbered (-1). In order to place a card, the number of the card must be greater than the number of the card on top of the center pile. Then, the newly placed card becomes the top card of the center pile. If a cow cannot place any card in their deck, the game is considered to be lost. Farmer John wonders: does there exist (p) such that it is possible for all of his cows to empty their deck after playing all (m) rounds of the game? If so, output any valid (p). Otherwise, output (-1). (^{\text{∗}})A permutation of length (n) contains each integer from (1) to (n) exactly once The first line contains an integer (t) ((1 \leq t \leq 400)) — the number of test cases. The first line of each test case contains two integers (n) and (m) ((1 \leq n \cdot m \leq 2\,000)) — the number of cows and the number of cards each cow receives. The following (n) lines contain (m) integers each – the cards received by each cow. It is guaranteed all given numbers (across all (n) lines) are distinct and in the range from (0) to $