Problem: One day Kefa the parrot was walking down the street as he was on the way home from the restaurant when he saw something glittering by the road. As he came nearer he understood that it was a watch. He decided to take it to the pawnbroker to earn some money. 

The pawnbroker said that each watch contains a serial number represented by a string of digits from 0 to 9, and the more quality checks this number passes, the higher is the value of the watch. The check is defined by three positive integers l, r and d. The watches pass a check if a substring of the serial number from l to r has period d. Sometimes the pawnbroker gets distracted and Kefa changes in some substring of the serial number all digits to c in order to increase profit from the watch. 

The seller has a lot of things to do to begin with and with Kefa messing about, he gave you a task: to write a program that determines the value of the watch.

Let us remind you that number x is called a period of string s (1 ≤ x ≤ |s|), if si = si + x for all i from 1 to |s| - x.

Input

The first line of the input contains three positive integers n, m and k (1 ≤ n ≤ 105, 1 ≤ m + k ≤ 105) — the length of the serial number, the number of change made by Kefa and the number of quality checks.

The second line contains a serial number consisting of n digits.

Then m + k lines follow, containing either checks or changes. 

The changes are given as 1 l r c (1 ≤ l ≤ r ≤ n, 0 ≤ c ≤ 9). That means that Kefa changed all the digits from the l-th to the r-th to be c. 

The checks are given as 2 l r d (1 ≤ l ≤ r ≤ n, 1 ≤ d ≤ r - l + 1).

Output

For each check on a single line print "YES" if the watch passed it, otherwise print "NO".

Examples

Input

3 1 2
112
2 2 3 1
1 1 3 8
2 1 2 1


Output

NO
YES


Input

6 2 3
334934
2 2 5 2
1 4 4 3
2 1 6 3
1 2 3 8
2 3 6 1


Output

NO
YES
NO

Note

In the first sample test two checks will be made. In the first one substring "12" is checked on whether or not it has period 1, so the answer is "NO". In the second one substring "88", is checked on whether or not it has period 1, and it has this period, so the answer is "YES".

In the second statement test three checks will be made. The first check processes substring "3493", which doesn't have period 2. Before the second check the string looks as "334334", so the answer to it is "YES". And finally, the third check processes substring "8334", which does not have period 1.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int mod = 1e9 + 13;
long long f[maxn], a[maxn], h[maxn];
char s[maxn];
void Init() {
  f[0] = 1;
  for (int i = 1; i <= maxn - 1; i++) f[i] = 1ll * f[i - 1] * 10 % mod;
  h[1] = 1;
  for (int i = 1; i <= maxn - 1; i++) h[i] = (h[i - 1] * 10ll + 1) % mod;
}
class Nd {
 public:
  int l, r, v;
  long long sum;
  Nd() {}
  Nd(int l, int r, int v, int s) : l(l), r(r), v(v), sum(s) {}
};
Nd nd[maxn * 4];
class Tree {
 public:
  void Build(int o, int l, int r) {
    if (l == r) {
      nd[o] = Nd(l, r, a[l], a[l]);
      return;
    }
    int mid = (l + r) >> 1;
    Build(o << 1, l, mid);
    Build((o << 1) | 1, mid + 1, r);
    nd[o] =
        Nd(l, r, -1,
           (nd[o << 1].sum * f[r - mid] % mod + nd[(o << 1) | 1].sum) % mod);
  }
  void Pushdown(int o) {
    if (nd[o].v != -1) {
      nd[o << 1].v = nd[o << 1 | 1].v = nd[o].v;
      int mid = (nd[o].l + nd[o].r) >> 1;
      nd[o << 1].sum = 1ll * nd[o].v * h[mid - nd[o].l + 1] % mod;
      nd[o << 1 | 1].sum = 1ll * nd[o].v * h[nd[o].r - mid] % mod;
      nd[o].v = -1;
    }
  }
  void Update(int o, int l, int r, int v) {
    if (nd[o].l >= l && nd[o].r <= r) {
      nd[o].v = v;
      nd[o].sum = (1ll * v * h[nd[o].r - nd[o].l + 1]) % mod;
      return;
    }
    int mid = (nd[o].l + nd[o].r) >> 1;
    Pushdown(o);
    if (l <= mid) Update(o << 1, l, r, v);
    if (r > mid) Update(o << 1 | 1, l, r, v);
    nd[o].v = -1,
    nd[o].sum =
        (nd[o << 1].sum * f[(nd[o].r - mid)] % mod + nd[o << 1 | 1].sum) % mod;
  }
  int Query(int o, int l, int r) {
    if (nd[o].l >= l && nd[o].r <= r) return nd[o].sum * f[r - nd[o].r] % mod;
    int mid = (nd[o].l + nd[o].r) >> 1;
    Pushdown(o);
    int ans = 0;
    if (l <= mid) ans = (ans + Query(o << 1, l, r)) % mod;
    if (r > mid) ans = (ans + Query(o << 1 | 1, l, r)) % mod;
    return ans;
  }
};
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  scanf("%s", s);
  for (int i = 1; i <= n; i++) a[i] = s[i - 1] - '0';
  int o = m + k, c, l, r, d;
  Init();
  Tree tree;
  tree.Build(1, 1, n);
  while (o--) {
    scanf("%d%d%d%d", &c, &l, &r, &d);
    if (c == 1) {
      tree.Update(1, l, r, d);
    } else {
      printf(
          "%s\n",
          (tree.Query(1, l, r - d) == tree.Query(1, l + d, r) ? "YES" : "NO"));
    }
  }
  return 0;
}