\(5^{th}\) round, February \(16^{th}\), 2013

Mislav and Marko have devised a new game, creatively named Rotate. First, Mirko imagines a number
sequence of length N and divides it into sections, with each section containing K numbers (K evenly
divides N). The first section contains numbers in the first K positions in the sequence, the second
section the following K positions, and so on.
Then, Marko asks Mislav to apply a number of operations on the sequence, with each operation being
one of the following two types:
1. Rotate the numbers in each section to the le\(ft/ri\)ght by X positions
2. Rotate the whole sequence to the le\(ft/ri\)ght by X positions
Notice that an operation of type 2 can change the numbers belonging to each section. After applying all
the operations, Mislav reveals the final sequence to Marko. Marko's task is finding Mislav's starting
sequence. He has asked you for help.

In test data worth at least 40% of total points, N will be at most 100.
In test data worth at least 70% of total points, K will be at most 100.
\(5^{th}\) round, February \(16^{th}\), 2013

The first line of input contains three positive integers: N (\(1 \le N \le 100\,000\)), the length of the
sequence, K (\(1 \le K \le 100\,000\)), the size of each section, and Q (\(1 \le Q \le 100\,000\)), the number of
operations.
Each of the following Q lines contains two integers: A (\(1 \le A \le 2\)), the operation type, and X (-100 000
≤ \(X \le 100\,000\)), the number of positions to rotate by. A negative number represents rotation to the
left, while a positive one represents rotation to the right.
The last line of input contains N spa\(ce-se\)parated integers Z_{i} (\(0 \le Z_{i} \le 100\,000\)) representing the final
sequence (after applying all operations).

The first and only line of output must contain the required starting sequence.

생성자가 기록되지 않았습니다.

출처 COCI 2012/2013 Contest 5