#include<bits/stdc++.h>
using namespace std;
#define N 100005
#define F(i,l,r) for(int i=(l);i<=(r);++i)
#define D(i,r,l) for(int i=(r);i>=(l);--i)
#define MEM(x,a) memset(x,a,sizeof(x))
int I() {char c=getchar(); int x=0; int f=1; while(c<'0' or c>'9') f=(c=='-')?-1:1,c=getchar(); while(c>='0' and c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar(); return ((f==1)?x:-x);}

int n,val[N]; char typ[N];
struct node
{
	int len,ans,drs,pos; int li,ri,lo,ro;
	int cl[76],cr[76];

	void prt()
	{
		printf("len=%d ans=%d li=%d ri=%d lo=%d ro=%d drs=%d pos=%d\n",len,ans,li,ri,lo,ro,drs,pos);
		printf("cl: "); F(i,0,75)if(cl[i]) printf("%d,%d ",i,cl[i]); puts("");
		printf("cr: "); F(i,0,75)if(cr[i]) printf("%d,%d ",i,cr[i]); puts("");
	}
};
node sing(int p,int x){char _=typ[p]; node t=(node){1,0,0,-1,-1,-1,-1,-1};MEM(t.cl,0);MEM(t.cr,0); if(_=='A')t.cl[x]=t.cr[x]=1,t.pos=p;else t.li=t.ri=t.lo=t.ro=x; return t;}
node mg_r(node A,node B)
{
	node C; C.ans=A.ans+B.ans; C.len=A.len+B.len; C.drs=A.drs+B.drs;
	F(i,0,B.li-1)C.ans+=A.cr[i];
	F(i,0,75)C.cl[i]=A.cl[i],C.cr[i]=B.cr[i];
	C.li=A.li; C.lo=A.lo; C.ri=B.ri; C.ro=B.ro;
	C.pos=-1;
	if(B.drs==0) {C.pos=A.pos; F(i,max(B.li,0),75)C.cr[i]+=A.cr[i]; C.ro=max(C.ro,A.ro);}
	if(A.drs==0) {C.li=max(C.li,B.li);}
	if(A.pos>0)
	{
		if(val[A.pos]<B.li && val[A.pos]>=A.ro && val[A.pos]>=A.lo) C.cl[val[A.pos]]--;
		if(val[A.pos]<B.li && val[A.pos]>=A.ro && val[A.pos]<A.lo)
		{
			/*
			puts("=================================");
			printf("fuck when merge-r A,B:\n");
			A.prt(); B.prt();
			puts("=================================");
			--C.ans;
			*/
		}
	}
	
	return C;
}
node mg_l(node A,node B)
{
	node C; C.ans=A.ans+B.ans; C.len=A.len+B.len; C.drs=A.drs+B.drs+1;
	F(i,0,A.ri-1)C.ans+=B.cl[i];
	F(i,0,75)C.cl[i]=A.cl[i],C.cr[i]=B.cr[i];
	C.li=A.li; C.lo=A.lo; C.ri=B.ri; C.ro=B.ro;
	C.pos=-1;
	if(A.drs==A.len-1) {C.pos=B.pos; F(i,max(A.ri,0),75)C.cl[i]+=B.cl[i]; C.lo=max(C.lo,B.lo);}
	if(B.drs==B.len-1) {C.ri=max(C.ri,A.ri);}
	if(B.pos>0)
	{
		if(val[B.pos]<A.ri && val[B.pos]>=B.lo && val[B.pos]>=B.ro) C.cr[val[B.pos]]--;
		if(val[B.pos]<A.ri && val[B.pos]>=B.lo && val[B.pos]<B.ro)
		{
			/*
			puts("=================================");
			printf("fuck when merge-l A,B:\n");
			A.prt(); B.prt();
			puts("=================================");

			--C.ans;
			*/
		}
	}
	/*
	if(B.ro==22 and C.ro!=22)
	{
		printf("fuck! B.ro=%d C.ro=%d\n",B.ro,C.ro);
	}
	*/
	return C;
}
class SegT
{
public:
	int dir[N]; int rv[N<<2];
	node a[N<<2],ra[N<<2];
#define ls u<<1
#define rs u<<1|1
#define ll ls,L,mid
#define rr rs,mid+1,R
	void up(int u,int L,int R)
	{
		int mid=(L+R)>>1,d=dir[mid];
		if(d==0)a[u]=mg_r(a[ls],a[rs]),ra[u]=mg_l(ra[ls],ra[rs]);
		else    a[u]=mg_l(a[ls],a[rs]),ra[u]=mg_r(ra[ls],ra[rs]);
		/*
		if(L>=20 and R==23)
		{
			printf("update %d[%d,%d] dir:%d\n",u,L,R,dir[mid]);
			printf("now ro=%d\n",a[u].ro);
		}
		*/
	}
	void build(int u=1,int L=1,int R=n)
	{
		if(L==1 and R==n)
		{
			MEM(dir,0);
		}
		if(L==R)
		{
			ra[u]=a[u]=sing(L,val[L]);
			return;
		}
		int mid=(L+R)>>1;
		build(ll); build(rr); up(u,L,R);

		// printf("u=%d [%d,%d]\n",u,L,R);
		// a[u].prt();
	}
	void rv1(int u)
	{
		swap(a[u],ra[u]); rv[u]^=1;
	}
	void down(int u,int L,int R)
	{
		if(rv[u])
		{
			int mid=(L+R)>>1;
			dir[mid]^=1;
			rv1(ls); rv1(rs);
			rv[u]=0;
		}
	}
	void rev(int l,int r,int u=1,int L=1,int R=n)
	{
		if(l<=L and R<=r) {rv1(u); return;}
		int mid=(L+R)>>1; down(u,L,R);
		if(r<=mid) rev(l,r,ll);
		else if(mid<l) rev(l,r,rr);
		else {rev(l,r,ll),rev(l,r,rr),dir[mid]^=1;}
		up(u,L,R); 
		// printf("pushup u=%d[%d,%d] dir:%d ans=%d\n",u,L,R,dir[mid],a[u].ans);
	}
	void change(int p,int x,int u=1,int L=1,int R=n)
	{
		if(L==R)
		{
			ra[u]=a[u]=sing(p,x);
			return;
		}
		int mid=(L+R)>>1; down(u,L,R);
		if(p<=mid) change(p,x,ll); else change(p,x,rr);
		up(u,L,R);
	}

	void prt(int u=1,int L=1,int R=n)
	{
		printf("u=%d [%d,%d]\n",u,L,R);
		a[u].prt();
		if(L==R)return;
		down(u,L,R); int mid=(L+R)>>1;
		prt(ll);prt(rr);
	}
	void downall(int u=1,int L=1,int R=n)
	{
		if(L==R)return;
		int mid=(L+R)>>1; down(u,L,R);
		downall(ll);downall(rr);
	}
}T;
void flandre()
{
	n=I(); int q=I();
	F(i,1,n)
	{
		int v=I(); char __[10];scanf("%s",__); char c=__[0];
		val[i]=v; typ[i]=c;
	}
	T.build();
	F(_,1,q)
	{
		char o[10];scanf("%s",o);
		if(o[0]=='R')
		{
			int l=I(),r=I();
			T.rev(l,r);
		}
		else
		{
			int p=I(),x=I();
			val[p]=x;
			T.change(p,x);
		}
		printf("%d\n",T.a[1].ans);
		if(0 && _==2936)
		{
			T.prt();
			F(i,1,n)
			{
				printf("%d",val[i]);
				if(i<n)printf(T.dir[i]?"<-":"->");
			} puts("");
			
			int _drs=0;F(i,1,n-1)_drs+=T.dir[i];
			printf("drs expected: %d\n",_drs);
		}
		// T.downall();
		/*
		F(i,1,n)
		{
			printf("%d",val[i]);
			if(i<n)printf(T.dir[i]?"<-":"->");
		}puts("");
		*/
	}
}
int main()
{
	int t=1;
	while(t-->0){flandre();}
	return 0;
}