/*
 _____ _             _              _           _
|_   _| |__   ___   / \   _ __  ___| |__  _   _| |
  | | | '_ \ / _ \ / _ \ | '_ \/ __| '_ \| | | | |
  | | | | | |  __// ___ \| | | \__ \ | | | |_| | |
  |_| |_| |_|\___/_/   \_\_| |_|___/_| |_|\__,_|_|

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define	endl		'\n'
#define mii         map<ll,ll>
#define msi         map<string,ll>
#define mis         map<ll, string>
#define rep(i,a,b)    for(ll i=a;i<b;i++)
#define repr(i,a,b) for(ll i=b-1;i>=a;i--)
#define trav(a, x) 	for(auto& a : x)
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pair<ll, ll>>
#define vs          vector<string>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define max(a,b)	(a>b?a:b)
#define min(a,b)	(a<b?a:b)

/*	For Debugging	*/
#define DEBUG 		cerr<<"\n>>>I'm Here<<<\n"<<endl;
#define display(x) trav(a,x) cout<<a<<" ";cout<<endl;
#define what_iss(x)  cerr << #x << " = " << x << endl;
#define what_is(x)  cerr << #x << " = " << x << " ";

std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define TIME        cerr << "\nTime elapsed: " << setprecision(5) <<1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
#define DECIMAL(n)  cout << fixed ; cout << setprecision(n);
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace __gnu_pbds;
using namespace std;
#define PI 3.141592653589793
#define N  100005
ll n;
vi v;

struct FenwickTree {
    vector<ll> bit;  // binary indexed tree
    ll n;
    map<ll,ll> ma;

    FenwickTree() {
        // this->n = n;
        // bit.assign(n, 0);
    }

    void addNumber(ll x) {
    	ma[x] = 1;
    }

    void process() {
    	ll cnt = 0;
    	trav(i,ma) {
    		i.S = cnt;
    		cnt++;
    	}
    	this->n  = sz(ma);
    	bit.assign(this->n,0);
    }

    // FenwickTree(vector<ll> a) : FenwickTree(a.size()) {
    //     for (size_t i = 0; i < a.size(); i++)
    //         add(i, a[i]);
    // }

    ll sum(ll r) {
    	r = ma[r];
        ll ret = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1)
            ret += bit[r];
        return ret;
    }

    ll sum(ll l, ll r) {
        return sum(r) - sum(l - 1);
    }

    void add(ll idx, ll delta) {
    	idx = ma[idx];
        for (; idx < n; idx = idx | (idx + 1))
            bit[idx] += delta;
    }
};

vector<FenwickTree> seg(4*N);
//  Path Compression at each node
void build(ll cur,ll st,ll end)
{
	if(st==end)
	{
		seg[cur].process();
		return;
	}
	ll mid=(st+end)>>1;
	build(2*cur,st,mid);
	build(2*cur+1,mid+1,end);
	seg[cur].process();
}
// add value for path compression on path of pos
void build(ll cur,ll st,ll end,ll pos,ll upd)
{
	if(st==end)
	{
		seg[cur].addNumber(upd);
		return;
	}
	ll mid = (st+end) >> 1;
	if(st<=pos&&pos<=mid)
		build(2*cur,st,mid,pos,upd);
	else
		build(2*cur+1,mid+1,end,pos,upd);
	seg[cur].addNumber(upd);
}
// add value for path compression of path from l to r
void build(ll cur,ll st,ll end,ll l,ll r,ll k)
{
	if(l<=st&&r>=end)
	return seg[cur].addNumber(k);
	if(r<st||l>end)
		return;                           /*  2-change here  */
	ll mid=(st+end)>>1;
	build(2*cur,st,mid,l,r,k);
	build(2*cur+1,mid+1,end,l,r,k);
	seg[cur].addNumber(k);
}


ll query(ll cur,ll st,ll end,ll l,ll r,ll k)
{
	if(l<=st&&r>=end)
	return seg[cur].sum(k);
	if(r<st||l>end)
	return 0;                           /*  2-change here  */
	ll mid=(st+end)>>1;
	ll ans1=query(2*cur,st,mid,l,r,k);
	ll ans2=query(2*cur+1,mid+1,end,l,r,k);
	return (ans1+ans2);                 /*  3-change here  */
}
void update(ll cur,ll st,ll end,ll pos,ll upd,ll vl)
{
	if(st==end)
	{
		seg[cur].add(upd,vl);
		return;
	}
	ll mid=(st+end)>>1;
	if(st<=pos&&pos<=mid)
		update(2*cur,st,mid,pos,upd,vl);
	else
		update(2*cur+1,mid+1,end,pos,upd,vl);
	seg[cur].add(upd,vl);
}

void solve()
{
	ll q;
	cin >> n >> q;
	v.resize(n);
	rep(i,0,n) {
		cin >> v[i];
		build(1, 0, n - 1, i, v[i]);
	}
	vector<pair<pii,pii>> data;
	char c;
	ll l,r,x;
	rep(i,0,q) {
		cin >> c;
		if(c == 'M') {
			cin >> l >> x;
			l--;
			build(1, 0, n - 1, l, x);
			data.pb({{1, l}, {x, -1}});
		} else {
			cin >> l >> r >> x;
			l--,r--;
			build(1, 0, n-1, l, r, x);
			data.pb({{2, l}, {r, x}});
		}
	}
	build(1,0,n-1);

	rep(i,0,n) {
		update(1, 0, n - 1, i, v[i], 1);
	}

	trav(i,data) {
		if(i.F.F == 1) {
			l = i.F.S, x = i.S.F;
			update(1, 0, n - 1, l, v[l], -1);
			v[l] = x;
			update(1, 0, n - 1, l, v[l], 1);
		} else {
			l = i.F.S, r = i.S.F, x = i.S.S;
			cout << query(1, 0, n - 1, l, r, x) << endl;
		}
	}
	return;
}
int main()
{
	FAST
	int TESTS=1;
//	cin>>TESTS;
	rep(i,0,TESTS)
    {
        // cout<<"Case #"<<i+1<<": ";
        solve();
    }
	// TIME
	return 0;
}