#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <fstream>
#include <cstdlib>
#include <vector>
#include <fstream>
#include <queue>
#include <stack>

using namespace std;

#define fast() ios_base::sync_with_stdio(false); cin.tie(0);

typedef long long ll;
typedef long double ld;

const ld INF = powl(10, 18);
const ld EPS = 1e-10;
const ld PI = 3.14159265358979323;
const ll zero = 0;
const int INFint = powl(10, 9);
const ll INFll = powl(10, 10);

int n, a[100000], l, r, k = 0, minVal = 1000000000;
ll t[4 * 200000];
char sign;

void build(int v, int vl, int vr, int a[]) {
	if (vl == vr) {
		t[v] = a[vl];
		return;
	}
	int vm = (vr + vl) >> 1;
	build(2 * v + 1, vl, vm, a);
	build(2 * v + 2, vm + 1, vr, a);
	t[v] = t[2 * v + 1] + t[2 * v + 2];
}

ll query(int v, int vl, int vr, int l, int r) {
	if (r < vl || vr < l)
		return 0;
	if (l <= vl && vr <= r)
		return t[v];
	int vm = (vr + vl) >> 1;
	ll ql = query(2 * v + 1, vl, vm, l, r);
	ll qr = query(2 * v + 2, vm + 1, vr, l, r);
	return ql + qr;
}

void modify(int v, int vl, int vr, int pos, int val) {
	if (vl == vr) {
		t[v] = val;
		return;
	}
	int vm = (vl + vr) >> 1;
	if (pos <= vm)
		modify(2 * v + 1, vl, vm, pos, val);
	else
		modify(2 * v + 2, vm + 1, vr, pos, val);
	t[v] = t[v * 2 + 1] + t[v * 2 + 1];
}

ll minn(ll v, ll vl,ll vr, ll l, ll r) {
	if (l > r)
		return INFll;
	if (vl == vr)
		return t[v];
	ll vm = (vl + vr) >> 1;
	return min(minn(v * 2 + 1, vl, vm, l, min(r, vm)), minn(v * 2 + 2, vm + 1, vr, max(l, vm + 1), r));
}


int main()
{
	//ifstream cin("input.txt");
	//ofstream cout("output.txt");
	fast(); //ДО, так сказать
	cin >> n >> k;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	build(0, 0, n - 1, a);
	while (k--) {
		cin >> sign >> l >> r;
		if (sign == 'U')
			modify(0, 0, n - 1, l - 1, r);
		else {
			minVal = 1000000000;
			cout << minn(0, 0, n - 1, l - 1, r - 1) << '\n';
		}
	}
	return 0;
}