#include <bits/stdc++.h>
using namespace std;
const int mxn = 100100;
const int mod = (int)1e9 + 7;
const int base = 97;
long long bit[mxn], bsum[mxn];
long long lazy[4 * mxn], sum[4 * mxn];
int n, q1, q2;
char s[mxn];
void init() {
  bit[0] = 1, bsum[0] = 1;
  memset(lazy, -1, sizeof lazy);
  for (int i = 1; i <= n; i++) bit[i] = bit[i - 1] * base % mod;
  for (int i = 1; i <= n; i++) bsum[i] = (bsum[i - 1] + bit[i]) % mod;
}
void build(int k, int l, int r) {
  if (l == r)
    sum[k] = lazy[k] = s[l] - '0';
  else {
    int mid = (l + r) >> 1;
    build(k << 1, l, mid);
    build(k << 1 | 1, mid + 1, r);
    sum[k] = (sum[k << 1] + sum[k << 1 | 1] * bit[mid - l + 1]) % mod;
  }
}
void push_down(int k, int l, int r) {
  int mid = (l + r) >> 1;
  lazy[k << 1] = lazy[k << 1 | 1] = lazy[k];
  if (r >= l) {
    sum[k << 1] = lazy[k] * bsum[mid - l] % mod;
    sum[k << 1 | 1] = lazy[k] * bsum[r - mid - 1] % mod;
  }
  lazy[k] = -1;
}
void update(int k, int l, int r, int x, int y, int v) {
  if (x == l && y == r) {
    lazy[k] = v;
    sum[k] = bsum[r - l] * v % mod;
  } else {
    if (lazy[k] >= 0 && l < r) {
      push_down(k, l, r);
      lazy[k] = -1;
    }
    int mid = (l + r) >> 1;
    if (y <= mid) {
      update(k << 1, l, mid, x, y, v);
    } else if (x > mid) {
      update(k << 1 | 1, mid + 1, r, x, y, v);
    } else {
      update(k << 1, l, mid, x, mid, v);
      update(k << 1 | 1, mid + 1, r, mid + 1, y, v);
    }
    sum[k] = (sum[k << 1] + sum[k << 1 | 1] * bit[mid - l + 1]) % mod;
  }
}
long long query(int k, int l, int r, int x, int y) {
  if (x > y) return 0;
  if (l == x && r == y) {
    return sum[k];
  }
  int mid = (l + r) >> 1;
  if (lazy[k] >= 0 && l < r) push_down(k, l, r);
  if (y <= mid) {
    return query(k << 1, l, mid, x, y);
  } else if (x > mid) {
    return query(k << 1 | 1, mid + 1, r, x, y);
  } else {
    return (query(k << 1, l, mid, x, mid) +
            query(k << 1 | 1, mid + 1, r, mid + 1, y) * bit[mid - x + 1]) %
           mod;
  }
}
int main() {
  scanf("%d%d%d", &n, &q1, &q2);
  init();
  scanf("%s", s + 1);
  build(1, 1, n);
  q1 += q2;
  while (q1--) {
    int op, l, r, c;
    scanf("%d%d%d%d", &op, &l, &r, &c);
    if (op == 1)
      update(1, 1, n, l, r, c);
    else {
      long long t1 = query(1, 1, n, l, r - c);
      long long t2 = query(1, 1, n, l + c, r);
      if (t1 == t2)
        puts("YES");
      else
        puts("NO");
    }
  }
  return 0;
}
