Sasha selects any $k$ out of $n$ slots he wishes and puts bullets there. Roma spins the cylinder so that every of $n$ possible cylinder's shifts is equiprobable. Then the game starts, the players take turns, Sasha starts: he puts the gun to his head and shoots. If there was no bullet in front of the trigger, the cylinder shifts by one position and the weapon is given to Roma for make the same move. The game continues until someone is shot, the survivor is the winner.
Sasha does not want to lose, so he must choose slots for bullets in such a way as to minimize the probability of its own loss. Of all the possible variant he wants to select the lexicographically minimal one, where an empty slot is lexicographically less than a charged one.
More formally, the cylinder of $n$ bullet slots able to contain $k$ bullets can be represented as a string of $n$ characters. Exactly $k$ of them are "X" (charged slots) and the others are "." (uncharged slots).
Let us describe the process of a shot. Suppose that the trigger is in front of the first character of the string (the first slot). If a shot doesn't kill anyone and the cylinder shifts, then the string shifts left. So the first character becomes the last one, the second character becomes the first one, and so on. But the trigger doesn't move. It will be in front of the first character of the resulting string.
Among all the strings that give the minimal probability of loss, Sasha choose the lexicographically minimal one. According to this very string, he charges the gun. You have to help Sasha to charge the gun. For that, each $x_i$ query must be answered: is there a bullet in the positions $x_i$?

The lexicographical comparison of is performed by the < operator in modern programming languages. The $a$ string is lexicographically less that the $b$ string, if there exists such $i\ (1≤i≤n)$, that $a_i<b_i$, and for any $j\ (1≤j<i)\ a_j=b_j$.