#include <bits/stdc++.h>
#define ll long long
#define all(x) (x).begin(),(x).end()
using namespace std;
void scan() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int INF = 0x3f3f3f3f;
const int maxn = 2e5 + 7;
int a[maxn], st[maxn << 2];
void build(int o, int l, int r) {
if (l == r) {
st[o] = a[l];
return;
}
int mid = l + ((r - l >> 1));
build(o << 1, l, mid);
build(o << 1 | 1, mid + 1, r);
st[o] = max(st[o << 1], st[o << 1 | 1]);
}
void update(int o, int l, int r, int x, int c) {
if (l == r) {
st[o] = c;
return;
}
int mid = l + ((r - l) >> 1);
if (x <= mid) update(o << 1, l, mid, x, c);
if (x >= mid + 1) update(o << 1 | 1, mid + 1, r, x, c);
st[o] = max(st[o << 1], st[o << 1 | 1]);
}
int query(int o, int l, int r, int ql, int qr) {
if (ql <= l && qr >= r) return st[o];
int mid = l + ((r - l) >> 1);
int maxx = -INF;
if (ql <= mid) {
maxx = max(maxx, query(o << 1, l, mid, ql, qr));
}
if (qr >= mid + 1) {
maxx = max(maxx, query(o << 1 | 1, mid + 1, r, ql, qr));
}
return maxx;
}
void solve(int T) {
int n, m;
while (cin >> n >> m) {
for (int i = 1; i <= n; i++) cin >> a[i];
build(1, 1, n);
while (m--) {
string ss;
cin >> ss;
if (ss[0] == 'Q') {
int ql, qr;
cin >> ql >> qr;
cout << query(1, 1, n, ql, qr) << endl;
} else {
int x, c;
cin >> x >> c;
update(1, 1, n, x, c);
}
}
}
}
int main() {
scan();
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin >> T;
for (int i = 1; i <= T; i++) solve(i);
return 0;
}