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 long long B1 = 11, B2 = 19;
const long long MOD = (1e9) + 7;
const int SIZE = 1 << 17;
const int TREE_SIZE = SIZE << 2;
struct rolling_hash {
  long long h1, h2;
  void initialize() {
    h1 = 0ll;
    h2 = 0ll;
  }
  void append(int a) {
    h1 = h1 * B1 + a;
    h1 %= MOD;
    h2 = h2 * B2 + a;
    h2 %= MOD;
  }
  bool operator<(const rolling_hash &a) const {
    if (h1 < a.h1) return true;
    if (h1 > a.h1) return false;
    return h2 < a.h2;
  }
  bool operator==(const rolling_hash &a) const {
    return (h1 == a.h1 && h2 == a.h2);
  }
};
struct tree_node {
  rolling_hash hash;
  int length;
  bool operator==(const tree_node &a) const {
    return (hash == a.hash && length == a.length);
  }
};
long long pow1[SIZE], pow2[SIZE];
int n, m, k, q;
char a[SIZE];
int arr[SIZE];
int lazy[TREE_SIZE];
rolling_hash its_hash[16][SIZE];
tree_node tree[TREE_SIZE];
tree_node crappy_node;
tree_node merge_them(tree_node a, tree_node b) {
  tree_node ans = a;
  ans.hash.h1 *= pow1[b.length];
  ans.hash.h1 += b.hash.h1;
  ans.hash.h1 %= MOD;
  ans.hash.h2 *= pow2[b.length];
  ans.hash.h2 += b.hash.h2;
  ans.hash.h2 %= MOD;
  ans.length += b.length;
  return ans;
}
void build_tree(int a, int b, int node) {
  if (a > b) return;
  if (a == b) {
    tree[node].length = 1;
    tree[node].hash = its_hash[arr[a]][1];
    return;
  }
  build_tree(a, (a + b) >> 1, node << 1);
  build_tree(((a + b) >> 1) + 1, b, (node << 1) | 1);
  tree[node] = merge_them(tree[node << 1], tree[(node << 1) | 1]);
}
void update_tree(int a, int b, int i, int j, int node, int value) {
  if (lazy[node] != (-1)) {
    tree[node].hash = its_hash[lazy[node]][tree[node].length];
    if (a != b) {
      lazy[node << 1] = lazy[node];
      lazy[(node << 1) | 1] = lazy[node];
    }
    lazy[node] = (-1);
  }
  if (a > b || b < i || a > j) return;
  if (a >= i && b <= j) {
    tree[node].hash = its_hash[value][tree[node].length];
    if (a != b) {
      lazy[node << 1] = value;
      lazy[(node << 1) | 1] = value;
    }
    return;
  }
  update_tree(a, (a + b) >> 1, i, j, node << 1, value);
  update_tree(((a + b) >> 1) + 1, b, i, j, (node << 1) | 1, value);
  tree[node] = merge_them(tree[node << 1], tree[(node << 1) | 1]);
}
tree_node query_tree(int a, int b, int i, int j, int node) {
  if (a > b || b < i || a > j) {
    tree_node ans;
    ans.hash.initialize();
    ans.length = 0;
    return ans;
  }
  if (lazy[node] != (-1)) {
    tree[node].hash = its_hash[lazy[node]][tree[node].length];
    if (a != b) {
      lazy[node << 1] = lazy[node];
      lazy[(node << 1) | 1] = lazy[node];
    }
    lazy[node] = (-1);
  }
  if (a >= i && b <= j) return tree[node];
  return merge_them(query_tree(a, (a + b) >> 1, i, j, node << 1),
                    query_tree(((a + b) >> 1) + 1, b, i, j, (node << 1) | 1));
}
int main() {
  int i, j, x, y, z, type;
  pow1[0] = 1;
  pow2[0] = 1;
  for (i = 1; i < SIZE; i++)
    pow1[i] = pow1[i - 1] * B1 % MOD, pow2[i] = pow2[i - 1] * B2 % MOD;
  for (i = 0; i < TREE_SIZE; i++) {
    tree[i].hash.initialize();
    tree[i].length = 0;
  }
  for (i = 0; i <= 9; i++) its_hash[i][0].initialize();
  for (i = 0; i <= 9; i++)
    for (j = 1; j < SIZE; j++)
      its_hash[i][j] = its_hash[i][j - 1], its_hash[i][j].append(i);
  memset(lazy, -1, sizeof(lazy));
  scanf("%d %d %d", &n, &m, &k);
  q = k + m;
  scanf("%s", a + 1);
  for (i = 1; i <= n; i++) arr[i] = a[i] - '0';
  build_tree(1, n, 1);
  for (i = 1; i <= q; i++) {
    scanf("%d %d %d %d", &type, &x, &y, &z);
    if (type == 1) {
      update_tree(1, n, x, y, 1, z);
    } else {
      if (z == y - x + 1)
        printf("YES\n");
      else if (query_tree(1, n, x, y - z, 1) == query_tree(1, n, x + z, y, 1))
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
}