RT：

#include<bits/stdc++.h>
using namespace std;
#define maxn 100005
int n,T,m;
short lazy[31][maxn<<2];
short tree[31][maxn<<2];
void pushup(short i,int k){
	tree[i][k]=tree[i][k<<1]+tree[i][k<<1|1];
}
void build(short i,int k,int l,int r){
	if(l==r){
		tree[i][k]=1;
	}else{
		int mid=(l+r)>>1;
		build(i,k<<1,l,mid);
		build(i,k<<1|1,mid+1,r);
		pushup(i,k);
	}
}
void pushdown(short i,int k){
	if(lazy[i][k]==-1){
		tree[i][k<<1]=tree[i][k<<1|1]=0;
		lazy[i][k<<1]=lazy[i][k<<1|1]=-1;
	}else{
		tree[i][k<<1]=tree[i][k<<1|1]=lazy[i][k];
		lazy[i][k<<1]=lazy[i][k<<1|1]=lazy[i][k];
	}
	lazy[i][k]=0;
}
void update(short i,int k,int l,int r,int L,int R,int val){
	if(L<=l&&r<=R){
		tree[i][k]=val;
		if(!val)lazy[i][k]=-1;
		else lazy[i][k]=val;
	}else{
		if(lazy[i][k])pushdown(i,k);
		int mid=(l+r)>>1;
		if(L<=mid) update(i,k<<1,l,mid,L,R,val);
		if(R>mid) update(i,k<<1|1,mid+1,r,L,R,val);
		pushup(i,k);
	}
}
short query(short i,int k,int l,int r,int L,int R){
	if(L<=l&&r<=R){
		return tree[i][k];
	}else{
		if(lazy[i][k])pushdown(i,k);
		int mid=(l+r)>>1;
		return query(i,k<<1,l,mid,L,R)||query(i,k<<1|1,mid+1,r,L,R);
	}
}
int main(){
	cin>>n>>T>>m;
	build(1,1,1,n);
	char option[3];
	int A,B,C;
	while(m--){
		scanf("%s%d%d",option,&A,&B);
		if(A>B)swap(A,B);
		if(option[0]=='C'){
			scanf("%d",&C);
			for(short i=1;i<=T;i++){
				if(i==C) update(i,1,1,n,A,B,1);
				else update(i,1,1,n,A,B,0);
			}
		}else{
			short tot=0;
			for(short i=1;i<=T;i++){
				if(query(i,1,1,n,A,B))tot++;
			}
			printf("%d\n",tot);
		}
	}
	return 0;
}