#include <cstdio>
#include <cstring>
#include <iostream>
#include <memory.h>
#include <algorithm>
#include <string>
#include <stack>
#include <vector>
#include <queue>using namespace std;
typedef long long LL;
const int MAXN = 1e5+10;int Seg[MAXN*4];
int lazy[MAXN*4];
int Vis[100];
int n, t, o;
int res;void PushDown(int root)
{if (lazy[root] != 0){Seg[root<<1] = (1<<lazy[root]);Seg[root<<1|1] = (1<<lazy[root]);lazy[root<<1] = lazy[root];lazy[root<<1|1] = lazy[root];lazy[root] = 0;}
}void PushUp(int root)
{Seg[root] = Seg[root<<1]|Seg[root<<1|1];
}void Build(int root, int l, int r)
{if (l == r){Seg[root] = 2;return;}int mid = (l + r) / 2;Build(root << 1, l, mid);Build(root << 1 | 1, mid + 1, r);PushUp(root);
}void Update(int root, int l, int r, int ql, int qr, int c)
{if (r < ql || qr < l)return;if (ql <= l && r <= qr){Seg[root] = (1<<c);lazy[root] = c;return;}PushDown(root);int mid = (l+r)/2;Update(root<<1, l, mid, ql, qr, c);Update(root<<1|1, mid+1, r, ql, qr, c);PushUp(root);
}int Query(int root, int l, int r, int ql, int qr)
{if (r < ql || qr < l)return 0;if (ql <= l && r <= qr){return Seg[root];}int mid = (l+r)/2;PushDown(root);int col1 = 0, col2 = 0;col1 = Query(root<<1, l, mid, ql, qr);col2 = Query(root<<1|1, mid+1, r, ql, qr);return col1|col2;
}int Get(int x)
{int res = 0;while (x){if (x&1)res++;x >>= 1;}return res;
}int main()
{char op[10];int a, b, c;while (~scanf("%d%d%d", &n, &t, &o)){Build(1, 1, n);while (o--){scanf("%s", op);if (op[0] == 'C'){scanf("%d%d%d", &a, &b, &c);if (a > b)swap(a, b);Update(1, 1, n, a, b, c);}else{scanf("%d%d", &a, &b);if (a > b)swap(a, b);memset(Vis, 0, sizeof(Vis));int res = Query(1, 1, n, a, b);printf("%d\n", Get(res));}}}return 0;
}