/* 
 * Problem: NOI2007 necklace
 * Author: Guo Jiabao
 * Time: 2009.6.5 16:30
 * State: Solved
 * Memo: 線段樹 標記下傳 上傳計算
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
using namespace std;
const int MAXN=500001;
struct SegmentTree
{
	struct Sgt_Node
	{
		Sgt_Node *left,*right;
		int a,b,lc,rc,cs,same;
	}SS[MAXN*2],*root;
	int SC;
	Sgt_Node * NewNode(int a,int b)
	{
		SS[++SC].same=0; SS[SC].a=a; SS[SC].b=b;
		SS[SC].lc=SS[SC].rc=0; SS[SC].cs=1;
		SS[SC].left = SS[SC].right = 0;
		return SS+SC;
	}
	void build(Sgt_Node *&x,int a,int b)
	{
		x=NewNode(a,b);
		if (a<b)
		{
			int m=(a+b) >> 1;
			build(x->left,a,m);
			build(x->right,m+1,b);
		}
	}
	void pushdown(Sgt_Node *x)
	{
		if (x->same)
		{
			x->lc = x->rc = x->same;
			x->cs = 1;
			if (x->a!=x->b)
				x->left->same = x->right->same = x->same;
			x->same=0;
		}
	}
	void update(Sgt_Node *x)
	{
		if (x->a!=x->b)
		{
			pushdown(x->left);
			pushdown(x->right);
			x->cs = x->left->cs + x->right->cs;
			if (x->left->rc == x->right->lc)
				x->cs --;
			x->lc = x->left->lc;
			x->rc = x->right->rc;
		}
	}
	int getcolor(Sgt_Node *x,int p)
	{
		pushdown(x);
		int m=(x->a + x->b) >> 1;
		if (x->a==x->b)
			return x->lc;
		else if (p<=m)
			return getcolor(x->left,p);
		else
			return getcolor(x->right,p);
	}
	void paint(Sgt_Node *x,int a,int b,int c)
	{
		int m=(x->a + x->b) >> 1;
		pushdown(x);
		if (x->a ==a && x->b==b)
		{
			x->same=c;
			pushdown(x);
		}
		else
		{
			if (b<=m)
				paint(x->left,a,b,c);
			else if (a>=m+1)
				paint(x->right,a,b,c);
			else
			{
				paint(x->left,a,m,c);
				paint(x->right,m+1,b,c);
			}
			update(x);
		}
	}
	int getcount(Sgt_Node *x,int a,int b)
	{
		int m=(x->a + x->b) >> 1,rs=0;
		pushdown(x);
		if (x->a ==a && x->b==b)
			return x->cs;
		else
		{
			if (b<=m)
				rs = getcount(x->left,a,b);
			else if (a>=m+1)
				rs = getcount(x->right,a,b);
			else
			{
				rs =  getcount(x->left,a,m);
				rs += getcount(x->right,m+1,b);
				if (x->left->rc == x->right->lc)
					rs--;
			}
		}
		update(x);
		return rs;
	}
}Segment;
int N,Q,C,offset;
bool flip;
inline void translate(int &a)
{
	if (flip)
		a=N-a+2;
	a-=offset;
	while (a<1) a+=N;
	while (a>N) a-=N;
}
int main()
{
	int i,k,c,a,b;
	char Cmd[5];
	freopen("necklace.in","r",stdin);
	freopen("necklace.out","w",stdout);
	scanf("%d%d",&N,&C);
	Segment.build(Segment.root,1,N);
	for (i=1;i<=N;i++)
	{
		scanf("%d",&c);
		Segment.paint(Segment.root,i,i,c);
	}
	scanf("%d",&Q);
	for (i=1;i<=Q;i++)
	{
		scanf("%s",Cmd);
		switch (Cmd[0])
		{
			case 'R':
				scanf("%d",&k);
				if (!flip)
					offset +=k ;
				else
					offset -=k ;
				while (offset<1) offset+=N;
				while (offset>N) offset-=N;
				break;
			case 'F':
				flip = !flip;
				break;
			case 'S':
				scanf("%d%d",&a,&b);translate(a);translate(b);
				c=Segment.getcolor(Segment.root,a);
				k=Segment.getcolor(Segment.root,b);
				Segment.paint(Segment.root,a,a,k);
				Segment.paint(Segment.root,b,b,c);
				break;
			case 'P':
				scanf("%d%d%d",&a,&b,&c);translate(a);translate(b);
				if (flip){k=a;a=b;b=k;}
				if (a<=b)
					Segment.paint(Segment.root,a,b,c);
				else
				{
					Segment.paint(Segment.root,a,N,c);
					Segment.paint(Segment.root,1,b,c);
				}
				break;
			case 'C':
				if (Cmd[1]=='S')
				{
					scanf("%d%d",&a,&b);
					translate(a);translate(b);
					if (flip){k=a;a=b;b=k;}
					if (a<=b)
						c=Segment.getcount(Segment.root,a,b);
					else
					{
						c=Segment.getcount(Segment.root,a,N);
						c+=Segment.getcount(Segment.root,1,b);
						if (Segment.root->lc == Segment.root->rc)
							c--;
					}
				}
				else
				{
					c=Segment.root->cs;
					if (c>1 && Segment.root->lc == Segment.root->rc)
						c--;
				}
				printf("%dn",c);
				break;
		}
	}
	return 0;
}