tj

#include <iostream>
#include <cstdio>
using namespace std;
int a[100005], sum[400005], lazytag[400005];
char tmp;
int l, r, val, c;
void update(int u, int l, int r, int val){sum[u] = (1 << val), lazytag[u] = val;}

void push_down(int u, int l, int r, int mid){
if(lazytag[u]){
update(u * 2, l, mid, lazytag[u]);
update(u * 2 + 1, mid + 1, r, lazytag[u]);
lazytag[u] = 0;
}
}

void __modify(int u, int l, int r, int x, int y, int val){
if(x <= l && y >= r){
update(u, l, r, val);
return;
}

int mid = l + r >> 1;
push_down(u, l, r, mid);
if(x <= mid) __modify(u * 2, l, mid, x, y, val);
if(y > mid) __modify(u * 2 + 1, mid + 1, r, x, y, val);
sum[u] = sum[u * 2] | sum[u * 2 + 1];

}

int __query(int u, int l, int r, int x, int y){
if(x <= l && y >= r) return sum[u];

int mid = l + r >> 1;
push_down(u, l, r, mid);
int ct = 0;
if(x <= mid) ct |= __query(u * 2, l, mid, x, y);
if(y > mid) ct |= __query(u * 2 + 1, mid + 1, r, x, y);

return ct;

}
#define modify(l, r, val) __modify(1, 1, n, l, r, val)
#define query(l, r) __query(1, 1, n, l, r)
signed main(){
int n, m, k;
cin >> n >> k >> m;
modify(1, n, 1);
while(m--){
cin >> tmp;
if(tmp == 'C'){
cin >> l >> r >> val;
if(l > r) swap(l, r);
modify(l, r, val);
}else{
cin >> l >> r;
if(l > r) swap(l, r);
cout << __builtin_popcount(query(l, r)) << endl;
}
}

return 0;

}