# include <math.h>

# include <stdio.h>

# include <string.h>

# include <iostream>

# include <algorithm>

// # include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef long double ld;

typedef unsigned long long ull;

const int M = 2e5 + , N = 2e6 + ;

const int mod = 1e9+;

# define RG register

# define ST static

int n, m, a[M], t[M];

int BLOCK, bl[M];

struct pa {

    int x, y, t;

    pa() {}

    pa(int x, int y, int t) : x(x), y(y), t(t) {}

    friend bool operator < (pa a, pa b) {

        return bl[a.x] < bl[b.x] || (bl[a.x] == bl[b.x] && bl[a.y] < bl[b.y]) ||

               (bl[a.x] == bl[b.x] && bl[a.y] == bl[b.y] && a.t < b.t);

    }

}q[M];

struct paa {

    int x, oc, nc, t;

    paa() {}

    paa(int x, int oc, int nc, int t) : x(x), oc(oc), nc(nc), t(t) {}

}p[M];

int pn, qn, ans[M];

int c[N], cnt, L, R;

inline void add(int x) {

    ++ c[a[x]];

    if(c[a[x]] == ) ++cnt;

}

inline void del(int x) {

    -- c[a[x]];

    if(c[a[x]] == ) --cnt;

}

inline void DEL(int x) {

    --c[x];

    if(c[x] == ) --cnt;

}

inline void ADD(int x) {

    ++c[x];

    if(c[x] == ) ++cnt;

}

int main() {

    cin >> n >> m;

    BLOCK = pow(n, 2.0/3.0);

    for (int i=; i<=n; ++i) {

        scanf("%d", a+i); t[i] = a[i];

        bl[i] = (i-)/BLOCK + ;

    }

    char opt[];

    for (int i=, x, y; i<=m; ++i) {

        scanf("%s%d%d", opt, &x, &y);

        if(opt[] == 'R') {

            p[++pn] = paa(x, t[x], y, i);

            t[x] = y;

        } else q[++qn] = pa(x, y, i);

        ans[i] = ;

    }

    sort(q+, q+qn+);

    L = , R = ;

    for (int i=, j=; i<=qn; ++i) {

        while(j <= pn && q[i].t > p[j].t) {

            if(L <= p[j].x && p[j].x <= R) DEL(p[j].oc), ADD(p[j].nc);

            a[p[j].x] = p[j].nc; ++j;

        }

        while(j- >=  && q[i].t < p[j-].t) {

            --j; if(L <= p[j].x && p[j].x <= R) DEL(p[j].nc), ADD(p[j].oc);

            a[p[j].x] = p[j].oc;

        }

        while(R < q[i].y) ++R, add(R);

        while(R > q[i].y) del(R), --R;

        while(L > q[i].x) --L, add(L);

        while(L < q[i].x) del(L), ++L;

        ans[q[i].t] = cnt;

    }

    for (int i=; i<=m; ++i)

        if(ans[i]) printf("%d\n", ans[i]);

    return ;

}