#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#define rep(i, l, r) for (int i = (l), i##end = (r); i <= i##end; ++i)
#define per(i, l, r) for (int i = (l), i##end = (r); i >= i##end; --i)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;
// using ll = long long;
// using lf = long double;
// using lll = __int128;
// using ull = unsigned long long;

using ll = __int128;

#define putc putchar
void write(ll x) {
  if (x == 0) {
    putc('0');
    return;
  }
  if (x > 9) write(x / 10);
  putc('0' + x % 10);
}

const int N = 1e5 + 9;
int n, m;
ll a[N];
string op;

ll GCD(ll a, ll b) {
  if (!a) return b;
  if (!b) return a;
  return __gcd(a, b);
}
ll LCM(ll a, ll b) {
  if (!a) return b;
  if (!b) return a;
  return a / GCD(a, b) * b;
}
struct atom {
  ll v[3];
  int len;
  void set(ll x) {
    v[0] = x, v[1] = v[2] = 0;
    len = 1;
  }
};
atom operator^(const atom &a, const atom &b) {
  atom res;
  res.v[0] = GCD(a.v[0], b.v[0]);
  res.v[1] = LCM(GCD(a.v[0], b.v[1]), GCD(a.v[1], b.v[0]));
  res.v[2] = GCD(a.v[1], b.v[1]);
  if (a.len >= 2) res.v[2] = LCM(res.v[2], GCD(a.v[2], b.v[0]));
  if (b.len >= 2) res.v[2] = LCM(res.v[2], GCD(a.v[0], b.v[2]));
  res.len = a.len + b.len;
  return res;
}

struct segment {
  int l, r, mid;
  atom x;
} p[N << 2];

void build(int u, int l, int r) {
  p[u].l = l, p[u].r = r, p[u].mid = (l + r) >> 1;
  if (l == r) {
    p[u].x.set(a[l]);
    // cerr << "! " << a[l] << endl;
    // log("[%d %d] >> %lld %lld %lld\n", p[u].l, p[u].r, p[u].x[0], p[u].x[1], p[u].x[2]);
    return;
  }
  build(u << 1, l, p[u].mid);
  build(u << 1 | 1, p[u].mid + 1, r);
  p[u].x = p[u << 1].x ^ p[u << 1 | 1].x;
  // log("[%d %d] >> %lld %lld %lld\n", p[u].l, p[u].r, (long long)p[u].x[0], (long long)p[u].x[1], (long long)p[u].x[2]);
}

void modify(int u, int k) {
  if (p[u].l == p[u].r) {
    p[u].x.set(a[p[u].l]);
    return;
  }
  if (k <= p[u].mid) {
    modify(u << 1, k);
  } else {
    modify(u << 1 | 1, k);
  }
  p[u].x = p[u << 1].x ^ p[u << 1 | 1].x;
}

atom query(int u, int l, int r) {
  if (p[u].l == l && p[u].r == r) {
    return p[u].x;
  }
  if (r <= p[u].mid) return query(u << 1, l, r);
  if (l > p[u].mid) return query(u << 1 | 1, l, r);
  return query(u << 1, l, p[u].mid) ^ //
         query(u << 1 | 1, p[u].mid + 1, r);
}

int main() {
#ifdef memset0
  freopen("H.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m;
  for (int x, i = 1; i <= n; i++) {
    cin >> x;
    a[i] = x;
  }
  build(1, 1, n);
  for (int l, r, k, x, i = 1; i <= m; i++) {
    cin >> op;
    if (op[0] == 'U') {
      cin >> k >> x;
      a[k] = x;
      modify(1, k);
    } else {
      cin >> l >> r >> k;
      auto it = query(1, l, r);
      write(it.v[k]), putc('\n');
    }
  }
}