- 总时间限制:
- 2000ms
- 内存限制:
- 65536kB

- 描述
Facer's pet cat just gave birth to a brood of little cats. Having considered the health of those lovely cats, Facer decides to make the cats to do some exercises. Facer has well designed a set of moves for his cats. He is now asking you to supervise the cats to do his exercises. Facer's great exercise for cats contains three different moves:

g i : Let the ith cat take a peanut.

e i : Let the ith cat eat all peanuts it have.

s i j : Let the ith cat and jth cat exchange their peanuts.

All the cats perform a sequence of these moves and must repeat it m times! Poor cats! Only Facer can come up with such embarrassing idea.

You have to determine the final number of peanuts each cat have, and directly give them the exact quantity in order to save them.- 输入
The input file consists of multiple test cases, ending with three zeroes "0 0 0". For each test case, three integers

*n*,*m*and*k*are given firstly, where*n*is the number of cats and*k*is the length of the move sequence. The following*k*lines describe the sequence.

(*m*≤1,000,000,000,*n*≤100,*k*≤100)- 输出
For each test case, output

*n*numbers in a single line, representing the numbers of peanuts the cats have.- 样例输入
3 1 6 g 1 g 2 g 2 s 1 2 g 3 e 2 0 0 0

- 样例输出
2 0 1

- 来源
- PKU Campus 2009 (POJ Monthly Contest – 2009.05.17), Facer

注意：这是练习题，不是作业题

- 全局题号
- 2746
- 添加于
- 2017-09-06
- 提交次数
- 30
- 尝试人数
- 6
- 通过人数
- 4