Eeny, meeny, miny, moe,
Catch a tiger by the toe.
If he hollers, let him go,
Eeny, meeny, miny, moe.
Similar verses exist in most languages, such as “Ulle dulle dof” in Finnish, “Akka bakka bonka rakka” in Norwegian, and “Ole dole doff” in Swedish.
Two teams are to be selected for a game and the rhyme is used to select one kid for a team at a time, alternating between the two teams, until all kids have been selected. The kids are standing in a circle. In each selection round we start counting the kids in clockwise order around the circle, skipping one kid for every word in the rhyme, until the last word. The kid matching the last word is chosen for the current team and then the next round starts. In all rounds but the first, the counting starts at the next remaining kid (in clockwise order) after the one that was selected in the previous round. See Figure 1 for an example.
Given such a rhyme, and a group of kids, can you tell which kids will be in which team?
The first line of input contains the rhyme, consisting of a list of words separated by spaces. The second line of input contains an integer $n$ ($1 \le n \le 100$), the number of kids. Then follow the names of the kids, one per line. The kids are given in clockwise order and the first kid listed is the one at which counting starts in the first round.
All words and names consist only of upper and lower case letters ‘A’-‘Z’ and ‘a’-‘z’. No input line is empty or longer than $100$ characters (excluding the newline character at the end of the line).
Output the two teams, starting with the one whose first member is chosen first. For each team, output the number of kids in the team, followed by the names of the kids in the team, in the same order as they were chosen for the team.
Sample Input 1 | Sample Output 1 |
---|---|
eeny meeny miny 4 Kalle Lisa Alvar Rakel |
2 Alvar Rakel 2 Lisa Kalle |
Sample Input 2 | Sample Output 2 |
---|---|
Every Other 3 a b c |
2 b c 1 a |