PivotOJ

Swapity Swap

시간 제한: 2000ms메모리 제한: 512MB출처: USACO 2020 February Contest, BronzeBOJ 18788

문제

Farmer John's NN cows (1≤N≤1001\le N\le 100) are standing in a line. The iith cow from the left has label ii, for each 1≤i≤N1\le i\le N.

Farmer John has come up with a new morning exercise routine for the cows. He tells them to repeat the following two-step process exactly KK (1≤K≤1091\le K\le 10^9) times:

  1. The sequence of cows currently in positions A1…A2A_1 \ldots A_2 from the left reverse their order (1≤A1<A2≤N1\le A_1<A_2\le N).
  2. Then, the sequence of cows currently in positions B1…B2B_1 \ldots B_2 from the left reverse their order (1≤B1<B2≤N1\le B_1<B_2\le N).

After the cows have repeated this process exactly KK times, please output the label of the iith cow from the left for each 1≤i≤N1\le i\le N.

입력

The first line of input contains NN and KK. The second line contains A1A_1 and A2A_2, and the third contains B1B_1 and B2B_2.

출력

On the iith line of output, print the label of the iith cow from the left at the end of the exercise routine.

힌트

Initially, the order of the cows is [1,2,3,4,5,6,7][1,2,3,4,5,6,7] from left to right. After the first step of the process, the order is [1,5,4,3,2,6,7].[1,5,4,3,2,6,7]. After the second step of the process, the order is [1,5,7,6,2,3,4][1,5,7,6,2,3,4]. Repeating both steps a second time yields the output of the sample.

예제

예제 1

입력
7 2
2 5
3 7
출력
1
2
4
3
5
7
6
코드를 제출하려면 로그인하세요.