#include <bits/stdc++.h>
using namespace std;

using LL = long long;
const int N = 2e5 + 5;

namespace BIT {
int n;
LL a[N];
void mdf(int x, LL v) {
  for (int i = x; i <= n; i += i & -i) a[i] += v;
}
LL qry(int x) {
  LL res = 0;
  for (int i = x; i > 0; i -= i & -i) res += a[i];
  return res;
}
} using BIT::mdf; using BIT::qry;

int n, m, q;
int a[N];
int st[20][N], b[N];

inline int get_gcd(int l, int r) {
  int h = __lg(r - l + 1);
  return __gcd(st[h][l], st[h][r - (1 << h) + 1]);
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m >> q;
  BIT::n = n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    mdf(i, a[i]);
  }
  for (int i = 1; i <= m; ++i) {
    cin >> b[i];
    st[0][i] = b[i];
  }
  for (int j = 1; j <= __lg(m); ++j)
    for (int i = 1; i + (1 << j) - 1 <= m; ++i)
      st[j][i] = __gcd(st[j - 1][i], st[j - 1][i + (1 << j - 1)]);
  while (q--) {
    char op;
    cin >> op;
    if (op == 'U') {
      int p, v;
      cin >> p >> v;
      mdf(p, v - a[p]);
      a[p] = v;
    } else {
      int l1, r1, l2, r2;
      cin >> l1 >> r1 >> l2 >> r2;
      int A = r1 - l1 + 1, B = get_gcd(l2, r2);
      LL s = qry(r1) - qry(l1 - 1);
      // if (s == 74277073403) {
      //   int sum = 0;
      //   for (int i = l2; i <= r2; ++i) sum = __gcd(sum, b[i]);
      //   cout << sum << "\n"; 
      // }
      // cout << A << " " << s << " " << B << "\n";
      B = __gcd(B, A);
      if (s % B) cout << "No\n";
      else {
        bool ok = true;
        if (B > 1) {
          for (int i = l1; i < l1 + B; ++i) {
            LL t = 0;
            for (int j = i; j <= r1; j += B) {
              t += a[j];
              if (t > s / B) break;
            }
            if (t != s / B) {
              ok = false;
              break;
            }
          }
        }
        cout << (ok ? "Yes" : "No") << "\n";
      }
    }
  }
  return 0;
}