说明：  　某英语课共有n 位学生，每位学生都有一个属于自己的整数学号。注意这一次由于课程的扩容，学生的人数非常多。 　　现在这门英语课准备进行期末考试，考试的形式是：每个学生单独与老师进行一段时间的口语对话。老师决定利用教室外的圆桌，按以下方法“随机”确定考试顺序：第一个到达的学生在圆桌周围任意选择一个位置坐下；此后到达的每位学生都从前一学生出发，沿逆时针方向围圆桌走过m 人（前一学生算作走过的第1 人，同一人可能经过多次），并紧邻第m 人右侧就座；所有学生到齐后，从最后到达者出发，绕圆桌以顺时针方向为序进行考试。
(Coaches a, B and C will choose their own players from the players numbered 1 to n. To be fair, each coach ranks the players according to their preference; you are responsible for assigning them players according to the following rules. The data you get is a, B, C three arrays, which show the three coaches' preference for the team members. Each array is an array of numbers from 1 to N. the smaller the subscript, the more the coach likes the team member (for example, coach a likes the player numbered a [0], followed by the player numbered a [1]). Your grouping rule is to find a coach a's favorite player from the unassigned players and assign it to group A; then, from the unallocated players, coach B's favorite player is assigned to group B; then coach C; then coaches a, B, and so on until all players are allocated. Now player K wants to know which coach he is assigned to. Please tell him.)