There are thieves and prisons. A thief is either on the run or caught in a prison. Initially all thieves are on the run.
A thief who is on the run can be caught by the police, and then ends up in one of the prisons. A thief who is on the run can also open the gate of a prison. Then every thief in that prison is released from the prison. It would be pointless to open the gate of an empty prison, so that never happens.
You are given a list of events of the form "thief has been caught" or "thief has opened the gate of a prison". Your task is to find a prison assignment that corresponds to the events, or determine that it is not possible.
输入格式
The first input line has three integers , and : the number of thieves, prisons and events. The thieves and prisons are numbered and .
After this, there are lines that describe the events. Each event is "C " (thief has been caught) or "O " (thief opens the gate of a prison).
输出格式
Print a valid prison assignment that consists of integers: for every event the corresponding prison. If there are no solutions, print "IMPOSSIBLE".
