description Trainers A, B and C will pick their team members from among those numbered 1 to n. To be fair, each coach sorts team members according to their preference; you are responsible for assigning team members to them according to the following rules. You get the data is a, b, c three arrays, said three coaches on the level of preferences of players, each array is a number from 1 to n per array, the smaller subscript coach said the more like the player ( For example, coach A prefers player a [0], followed by player a [1]). Your grouping rule is to find a coach A from the unassigned team members, and then to group B the unassigned team member's favorite team member B. Then, coach C ; Then coaches A, B ... and so on until all players have been assigned. Now player k wants to know which coach he is assigned to. Please tell him.

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．