시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
3 초 256 MB 1 1 1 100.000%

## 문제

Company T specializes in selling necklaces with colored beads. The produced necklaces have fashionable designs, varied styles, and affordable prices, making them widely popular amongst young people. Recently, company T decided to launch a necklace "buffet" production system so that customers can decide for themselves which necklace design is most beautiful.

The necklace buffet production system includes a hardware system and a software system. The software system interacts with the user to control the hardware system, while the hardware system receives the commands from the software system and produces the specified necklace. The hardware system has already been completed, however the software system has yet to be developed. Company T's people have found you, competing at the National Olympiad in Informatics. Can you help company T write a software simulation system?

A necklace contains N beads, and each bead is a color from colors 1, 2, …, c. The necklace is secured onto a flat board. Some place on the board is labeled as position 1, and going clockwise from there, other places on the board are labeled positions 2, 3, …, N.

The program you design must support the following commands:

Command Parameter Constraints Details
R k 0 < k < N Meaning Rotate k. The necklace on the board is rotated clockwise by k spots. The bead at position 1 moves to position k + 1, the bead at position 2 moves to position k + 2, and so on.
F   Meaning Flip. The necklace is flipped along the given axis of symmetry. The bead at position 1 does not move, the bead at position 2 swaps places with the bead at position N, the bead at position 3 swaps places with the bead at position N − 1, and so forth.
S i j 1 ≤ ij ≤ N Meaning Swap ij. The bead at position i swaps places with the bead at position j
P i j x 1 ≤ ij ≤ Nx≤ c Meaning Paint ij. The segment of beads starting at position i, inclusive, and ending at position j, inclusive, is painted color x.
C   Meaning Count. Query how many "sections" form the current necklace. We consider a consecutive segment with all beads the same color to be a "section".
CS i j 1 ≤ ij ≤ N Meaning CountSegment ij. Query how many sections form the segment of the current necklace starting at position i, inclusive, and ending at position j, inclusive.

## 입력

The first line of input contains two integers N and c, respectively representing the number of beads in the necklace and the number of colors.

The second line contains N integers x1x2, …, xN, representing the color of the beads from locations 1 through N, where 1 ≤ xi ≤ c.

The third line of input contains an integer Q, the number of queries to follow.

The following Q lines each contain a single command in one of the formats described above.

## 출력

For each C and CS command, output on a separate line an integer corresponding to the appropriate answer.

## 제한

N ≤ 500 000, Q ≤ 500 000, c ≤ 1 000.

## 예제 입력 1

5 3
1 2 3 2 1
4
C
R 2
P 5 5 2
CS 4 1


## 예제 출력 1

4
1


## 힌트

Note that the rotate command rotates the beads, not the numberings of the positions. Also, the flip command will always have position 1 as its axis of symmetry.

The CS command asks for how many "sections" are within a "segment". Especially take note of when a length N segment is queried. We still have to treat the queried region as a "segment".