Swapity Swapity Swap#10120
Farmer John's cows are standing in a line. The -th cow from the left has label (1 \leq i \leq n). Farmer John has come up with a new morning exercise routine for the cows. He has given the cows pairs of integers (l_1, r_1), \ldots, (l_m, r_m). He then tells the cows to repeat the following -step process exactly times:
For each from to :
- The sequence of cows currently in positions l_i ... r_i from the left reverse their order.
After the cows have repeated this process exactly times, print the label of the -th cow from the left for each (1 \leq i \leq n).
The first line contains (1 \leq n \leq 10^5), (1 \leq m \leq 100) and (1 \leq k \leq 10^9). For each (1 \leq i \leq m), line i + 1 line contains l_i and r_i, both integers in the range ..., where l_i < r_i.
On the -th line print the -th element of the array after the instruction string has been executed times.
Example 1
Initially, the order of the cows is [, , , , , , ] from left to right. After the first step of the process, the order is [, , , , , , ]. After the second step of the process, the order is [, , , , , , ]. Repeating both steps a second time yields the output of the sample.