const max=200000;
var tt,n,t,q,x,y,z,i:longint;
l,r,c,d,ls,rs:array[1..max]of longint;
ch:char;
procedure down(x:longint);
begin
if d[x]>0
then begin
c[x]:=d[x];
if ls[x]<>0 then d[ls[x]]:=d[x];
if rs[x]<>0 then d[rs[x]]:=d[x];
d[x]:=0;
end;
end;
procedure update(x:longint);
begin
down(ls[x]); down(rs[x]);
c[x]:=c[ls[x]] or c[rs[x]];
end;
procedure build(a,b:longint);
var x,mid:longint;
begin
inc(tt); x:=tt;
c[x]:=1; d[x]:=0;
l[x]:=a; r[x]:=b;
if b-a>1
then begin
mid:=(a+b)shr 1;
ls[x]:=tt+1; build(a,mid);
rs[x]:=tt+1; build(mid,b);
end;
end;
procedure cover(x,a,b,c:longint);
var mid:longint;
begin
down(x);
if (a<=l[x])and(r[x]<=b)
then d[x]:=c
else begin
mid:=(l[x]+r[x])shr 1;
if a<mid then cover(ls[x],a,b,c);
if b>mid then cover(rs[x],a,b,c);
update(x);
end;
end;
function count(x,a,b:longint):longint;
var mid:longint;
begin
down(x);
if (a<=l[x])and(r[x]<=b)
then count:=c[x]
else begin
count:=0;
mid:=(l[x]+r[x])shr 1;
if a<mid then count:=count or count(ls[x],a,b);
if b>mid then count:=count or count(rs[x],a,b);
end;
end;
function calcu(x:longint):longint;
begin
calcu:=0;
while x>0 do
begin
calcu:=calcu+x and 1;
x:=x shr 1;
end;
end;
begin
assign(input,'Count.in'); reset(input);
assign(output,'Count.out'); rewrite(output);
readln(n,t,q);
build(0,n);
for i:=1 to q do
begin
read(ch,x,y);
if x>y
then begin
z:=x; x:=y; y:=z;
end;
if ch='P'
then writeln(calcu(count(1,x-1,y)))
else begin
read(z);
cover(1,x-1,y,1 shl (z-1));
end;
readln;
end;
close(input); close(output);
end.