/*
Author : Chandan Agrawal
College : Poornima College of Engg. jaipur, Raj
Mail : chandanagrawal23@gmail.com
" when you are not practicing someone else is ,
and the day u meet them u will lose "
*/
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define MAX 300050
#define ll long long
#define ld long double
#define lli long long int
#define pb push_back
#define INF 1000000000000
#define mod 1000000007
// trignometric function always give value in Radians only
#define PI acos(-1) //3.1415926535897932384626433832795028
#define dsin(degree) sin(degree*(PI/180.0))
#define dcos(degree) cos(degree*(PI/180.0))
#define dtan(degree) tan(degree*(PI/180.0))
#define rsin(radian) sin(radian)
#define rcos(radian) cos(radian)
#define rtan(radian) tan(radian)
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define memf(a) memset(a,false,sizeof(a))
#define loop(i,n) for (lli i = 0; i < n; i++)
#define FOR(i,a,b) for (lli i = a; i < b; i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define makeuniq(v) v.resize(unique(all(v)) - v.begin()); //only uniq element in vector after this
#define sz(x) int(x.size())
#define F first
#define S second
#define mii map<lli,lli>
#define pii pair<lli,lli>
#define vi vector<lli>
#define vvi vector<vi>
#define vpi vector<pii>
#define vbool vector<bool>
#define seti set<lli>
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) (a/gcd(a,b))*b
#define abs(x) ((x < 0)?-(x):x)
#define endl '\n'
template <typename Head>
void print(Head&& head)
{
cout<<head<<endl;
}
template <typename Head, typename... Tail>
void print(Head&& head, Tail... tail)
{
cout<<head<<" ";
print(tail...);
}
#define scanarr(a,n) for(lli i=0;i<n;i++) cin>>a[i];
#define scanvec(a,n) for(lli i=0;i<n;i++){ lli x ; cin>>x; a.pb(x);}
#define printarr(a,n) for(lli i=0;i<n;i++) cout<<a[i]<<" "; cout<<endl;
#define printvec(vec) for(auto xt : vec) cout<<xt<<" "; cout<<"\n";
#define FD(N) fixed<<setprecision(N)
#define deb(x) cout<<#x<<" "<<x<<endl;
/*
1D vector - vi dp(n,value);
2D vector - vvi dp(n,vi(n,value));
*/
// chandan1,2
void chandan1(){int y=1;return;}
void chandan2(){
loop(i,10){
lli x=1;
}
return(chandan1());
}
//---------------------------------------------------SQRT_DECOMPO-------------------------------------------------------
lli n , a[MAX];
vi block[600];
lli blk_sz;
// clear all data
void clear()
{
mem0(a);
loop(i,600)
block[i].clear();
}
// preprocess array to sqrt decomposition
void preprocess(lli n)
{
blk_sz = sqrt(n);
lli blk_ind = -1;
loop(i,n)
{
if(i % blk_sz == 0)
blk_ind++;
block[blk_ind].pb(a[i]); //push elements of sqrt size each
}
loop(i,blk_sz+1)
{
sort(all(block[i]));
}
}
lli binarySearchCount(vi &arr, lli key)
{
lli left = 0;
lli right = sz(arr) - 1;
lli count = 0;
while (left <= right) {
lli mid = (right + left) / 2;
// Check if middle element is
// less than or equal to key
if (arr[mid] <= key) {
// At least (mid + 1) elements are there
// whose values are less than
// or equal to key
count = mid + 1;
left = mid + 1;
}
// If key is smaller, ignore right half
else
right = mid - 1;
}
return count;
}
// query to count total values from l to r which have greater value then or equal to K
lli query(lli l , lli r , lli k)
{
lli left_block = l/blk_sz;
lli right_block = r/blk_sz;
lli cnt=0;
if(left_block == right_block)
{
for(lli i=l;i<=r;i++)
cnt += (a[i]<=k);
}
else
{
for(lli i=l;i<blk_sz*(left_block+1);i++) // traversing first block in range
cnt += (a[i]<=k);
for(lli i=left_block+1;i<right_block;i++) // traversing completely overlapped blocks in range
{
cnt += binarySearchCount(block[i],k); //count how many elements in array which are less than equal to k
}
for(lli i=blk_sz*right_block;i<=r;i++) // traversing last block in range
cnt += (a[i]<=k);
}
return cnt;
}
void update(lli ind , lli val)
{
lli block_number = ind / blk_sz;
lli start = block_number*blk_sz;
lli endi = (block_number+1)*blk_sz;
a[ind] = val;
block[block_number].clear();
for(lli i=start;i<endi;i++)
block[block_number].pb(a[i]);
sort(all(block[block_number]));
}
//---------------------------------------------------SQRT_DECOMPO-------------------------------------------------------
// find count how many values less than or equal to k in L to R :https://w...content-available-to-author-only...j.com/problems/RACETIME/
int main(){
fastio
chandan2();
lli t=1;
//cin>>t;
while(t--)
{
lli q;
cin>>n>>q;
loop(i,n)
cin>>a[i];
preprocess(n);
while(q--)
{
char type;
cin>>type;
if(type == 'C')
{
lli l,r,k;
cin>>l>>r>>k;
l--;
r--;
print(query(l,r,k));
}
else
{
lli ind,val;
cin>>ind>>val;
ind--;
update(ind,val);
}
}
clear();
}
return 0;
}