Introduction - If you have any usage issues, please Google them yourself
Description Coach A, B and C will be numbered 1 to n players to choose their players. To be fair, every coach according to their degree of preference will sort the players you are responsible for their assigned team members according to the following rules. The data you get is a, b, c three arrays representing three coaches on the team sort of degree of preference, each array is a permutation of numbers 1 to n, the smaller the index indicates more like the coach of the team. Your grouping rule is to find a coach A favorite team assigned to Group A has not yet been allocated the team then, in unallocated players assigned coach B favorite players to group B then the coach C then coach a, B ...... and so on until all the players allocated. K players now want to know which they have been assigned to coach, you tell him. Enter the total of five lines. The first line contains an integer n. The first 2-4 lines followed by an array of a, b and c, each row is an integer [1, n] a permuta