Little Z has a bunch of block ordered in a row. Each block is colored either in black or white color. Tomorrow, his friend will come to visit him and they will play next game:
Little Z will close his eyes and his friend will start swaping sub-rows of blocks. When they ask him how many blocks are colored in black in some sub-row he should tell them.

Please, help to Little Z and write program that give answers, so he could always know correct answer.

INPUT:
The first line of the standard input contains two space-separated cardinals N, (1 <= N <= 20 000), representing number of blocks and Q (1 <= Q <= 200 000), representing number of operations. In the next line you will be given string of the length N consisted of upper-case letters 'B' and 'W' ('B' stands for black, 'W' stands for white), where i-th character represents color of i-th block. Next Q lines will contain operations.
Possible operations are:
S pos1 pos2 length - means that blocks at positions (pos1, pos1 + 1, ..., pos1 + length - 1) should be swaped with blocks at positions (pos2, pos2 + 1, ..., pos2 + length - 1). 1 <= pos1, pos2 <= N; 1 <= length <= 800; pos1 + length - 1, pos2 + length - 1 <= N. Blocks that should be swaped in one operation will never overlap.

C pos1 pos2 - print how many blocks colored in black are at positions from interval [ pos1, pos2 ]. 1 <= pos1 <= pos2 <= N; pos2 - pos1 + 1 <= 800.

OUTPUT:
On the standard output for each C operation print the answer in order they appear in the input. Each answer should be printed in a new line.

Input:

Output:

Input:

Output: