#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
struct node {
    ll maxi;
    ll mini;
};
node t[4 * 200200];
ll arr[200200];
node merge(node a, node b)
{
    node ans;
    ans.maxi = max(a.maxi, b.maxi);
    ans.mini = min(a.mini, b.mini);
    return ans;
}
void build(ll id, ll l, ll r)
{
    if (l == r)
    {
        t[id].maxi = arr[l];
        t[id].mini = arr[l];
        return;
    }
    ll mid = (l + r) / 2;
    build(2 * id, l, mid);
    build(2 * id + 1, mid + 1, r);
    t[id] = merge(t[2 * id], t[2 * id + 1]);
}
void update(ll id, ll l, ll r, ll pos, ll val)
{
    if (pos < l || pos > r)
    {
        return;
    }
    if (l == r)
    {
        t[id].maxi = val;
        t[id].mini = val;
        return;
    }
    ll mid = (l + r) / 2;
    update(2 * id, l, mid, pos, val);
    update(2 * id + 1, mid + 1, r, pos, val);
    t[id] = merge(t[2 * id], t[2 * id + 1]);
}
ll query(ll id, ll l, ll r, ll lq, ll rq)
{
    if (lq > t[id].maxi || t[id].mini > rq)
    {
        return 0;
    }
    if (t[id].mini >= lq && t[id].maxi <= rq)
    {
        return (r - l + 1);
    }
    ll mid = (l + r) / 2;
    return (query(2 * id, l, mid, lq, rq) + query(2 * id + 1, mid + 1, r, lq, rq));
}
int main()
{
    fast_cin();
    ll n, q;
    cin >> n >> q;
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }
    build(1, 0, n - 1);
    while (q--)
    {
        char c;
        cin >> c;
        if (c == '?')
        {
            ll a, b;
            cin >> a >> b;
            cout << query(1, 0, n - 1, a, b) << "\n";
        }
        else
        {
            ll k, x;
            cin >> k >> x;
            k--;
            update(1, 0, n - 1, k, x);
        }
    }
    return 0;
}