CF120G Boom

Let's consider the famous game called Boom (aka Hat) with simplified rules. There are $ n $ teams playing the game. Each team has two players. The purpose of the game is to explain the words to the teammate without using any words that contain the same root or that sound similarly. Player $ j $ from team $ i $ $ (1

The first line contains two integers $ n,t $ $ (1

Print $ n $ lines. On the $ i $ -th line first print number $ s_{i} $ the number of points the $ i $ -th team wins. Then print $ s_{i} $ space-separated words — the words from the cards guessed by team $ i $ in the order in which they were guessed.