There are 3 students from Korea, China, and Japan, so total of 9 students are present. How many ways are there to make them sit down in a circular table, with equally spaced and equal chairs, such that the students from the same country do not sit next to each other? If array A can become array B by rotation, these two arrays are considered equal. combinatoricsCircular permutations