Clothesline

Jukul has many red, green, and blue shirts from programming contests. He washed them all and hung them in a row on a clothesline. He did not like the order of the shirts on the line.

So Juku computed the most pleasing arrangement of the shirts, along with the moves needed to reach it. Between moves, he wants to check that all his shirts are still on the line. To do that, he wants to know how many shirts of a given color are in a segment of the line.

The first line contains the number of shirts $N$ and the number of queries $Q$ ($1 \le N \le 10^5$, $1 \le Q \le 10^5$).

The second line is a string of length $N$, the initial order of the shirts. P is a red shirt, R is a green shirt, and S is a blue shirt.

Each of the next $Q$ lines contains a query in the form T $L$ $R$ ($1 \le L \le R \le N$). $T$ is the query type, and $L$ and $R$ are the positions of the shirts the query applies to. There are six query types:

1. If $T$ is PUNASEID, count the red shirts in positions $L$ to $R$ of the line.
2. If $T$ is ROHELISI, count the green shirts in positions $L$ to $R$.
3. If $T$ is SINISEID, count the blue shirts in positions $L$ to $R$.
4. If $T$ is ETTE, cut out the segment from $L$ to $R$ and tie it to the start of the line. The two loose ends left behind are tied together so the shirts do not fall.
5. If $T$ is TAHA, cut out the segment from $L$ to $R$ and tie it to the end of the line. The two loose ends left behind are tied together so the shirts do not fall.
6. If $T$ is POORA, cut out the segment from $L$ to $R$, reverse it, and tie it back into the same place.

For each PUNASEID, ROHELISI, or SINISEID query, print the answer on a separate line.