B'The Hat is a game of speedy explanation/guessing words (similar to Alias). It 's fun. Try it! In this problem, we are talking about a variant of the game when the players are sitting at the table and everyone plays individually (i.e. not teams, but individual gamers play). n people gathered in a room with m tables ( n ge 2m ). They want to play the Hat k times. Thus, k games will be played at each table. Each player will play in k games. To do this, they are distributed among the tables for each game. During each game, one player plays at exactly one table. A player can play at different tables. Players want to have the most "fair" schedule of games. For this reason, they are looking for a schedule (table distribution for each game) such that: For example, if n=5 , m=2 and k=2 , then at the request of the first item either two players or three players should play at each table. Consider the following schedules: Find any "fair" game schedule for n people if they play on the m tables of k games. The first line of the input contains an integer t ( 1 <= t <= 10^4 ) -- the number of test cases in the test. Each test case consists of one line that contains three integers n , m and k ( 2 <= n <= 2 cdot10^5 , 1 <= m <= lfloor frac{n}{2} rfloor , 1 <= k <= 10^5 ) -- the number of people, tables and games, respectively. It is guaranteed that the sum of nk ( n multiplied by k ) over all test cases does not exceed 2 cdot10^5 . For each test case print a required schedule -- a sequence of k blocks of m lines. Each block corresponds to one game, a line in a block corresponds to one table. In each line print the number of players at the table and the indices of the players (numbers from 1 to n ) who should play at this table. If there are several required schedules, then output any of them. We can show that'...