// luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;inline int read(){int sum=0,f=1;char ch=getchar();while(ch>'9' || ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0' && ch<='9'){sum=sum*10+ch-'0';ch=getchar();}return f*sum;
}struct node{int l,r,id,ti;
}q[100001];
struct chang{int pla/*第几支笔*/,to/*颜色*/;
}c[100001];
int n,m,qsum,csum;
int l,r,timn,gap;
int a[100001],ans=0,bl[100001];
int sum[1000001];
int ansn[100001];
char opt[5];bool cmp(node a,node b)
{if(bl[a.l] == bl[b.l]){if(bl[a.r] == bl[b.r]) return a.ti < b.ti;return a.r < b.r; }return a.l < b.l;
}inline void add(int x){if(!(sum[a[x]]++)) ans++;
}inline void del(int x){if(!(--sum[a[x]])) ans--;
}inline void change(int ti,int i){if(c[ti].pla>=q[i].l&&c[ti].pla<=q[i].r) {if(!(--sum[a[c[ti].pla]])) ans--;if(!(sum[c[ti].to]++)) ans++;}swap(a[c[ti].pla],c[ti].to);
}int main(){//freopen("data12.in","r",stdin);n=read();m=read();gap=n/sqrt(m*2.0/3.0);//gap=sqrt(n);for(int i=1;i<=n;i++) bl[i]=(i-1)/gap+1; for(int i=1;i<=n;i++) a[i]=read();for(int i=1;i<=m;i++){cin>>opt;if(opt[0]=='Q'){q[++qsum].id=qsum;q[qsum].l=read();q[qsum].r=read();q[qsum].ti=csum;}else if(opt[0]=='R'){c[++csum].pla=read();c[csum].to=read();}ansn[q[i].id]=ans;}sort(q+1,q+qsum+1,cmp);l=1;r=0;timn=0;for(int i=1;i<=qsum;i++){int ql=q[i].l,qr=q[i].r;int qtime=q[i].ti;while(l<ql) del(l++);while(l>ql) add(--l);   while(r>qr) del(r--);        while(r<qr) add(++r);while(timn<qtime) change(++timn,i);while(timn>qtime) change(timn--,i);        ansn[q[i].id]=ans;}for(int i=1;i<=qsum;i++){printf("%d\n",ansn[i]);}return 0;
}