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>
#pragma comment(linker, "/stack:20000000")
using namespace std;
double __begin;
template <typename T1, typename T2, typename T3>
struct triple {
  T1 a;
  T2 b;
  T3 c;
  triple(){};
  triple(T1 _a, T2 _b, T3 _c) : a(_a), b(_b), c(_c) {}
};
template <typename T1, typename T2, typename T3>
bool operator<(const triple<T1, T2, T3> &t1, const triple<T1, T2, T3> &t2) {
  if (t1.a != t2.a)
    return t1.a < t2.a;
  else if (t1.b != t2.b)
    return t1.b < t2.b;
  else
    return t1.c < t2.c;
}
template <typename T1, typename T2, typename T3>
inline std::ostream &operator<<(std::ostream &os, const triple<T1, T2, T3> &t) {
  return os << "(" << t.a << ", " << t.b << ", " << t.c << ")";
}
inline int bits_count(int v) {
  v = v - ((v >> 1) & 0x55555555);
  v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
  return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
inline int bits_count(long long v) {
  int t = v >> 32;
  int p = (v & ((1LL << 32) - 1));
  return bits_count(t) + bits_count(p);
}
unsigned int reverse_bits(register unsigned int x) {
  x = (((x & 0xaaaaaaaa) >> 1) | ((x & 0x55555555) << 1));
  x = (((x & 0xcccccccc) >> 2) | ((x & 0x33333333) << 2));
  x = (((x & 0xf0f0f0f0) >> 4) | ((x & 0x0f0f0f0f) << 4));
  x = (((x & 0xff00ff00) >> 8) | ((x & 0x00ff00ff) << 8));
  return ((x >> 16) | (x << 16));
}
inline int sign(int x) { return x > 0; }
inline bool isPowerOfTwo(int x) { return (x != 0 && (x & (x - 1)) == 0); }
template <typename T1, typename T2>
inline std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
inline std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
  bool first = true;
  os << "[";
  for (unsigned int i = 0; i < v.size(); i++) {
    if (!first) os << ", ";
    os << v[i];
    first = false;
  }
  return os << "]";
}
template <typename T>
inline std::ostream &operator<<(std::ostream &os, const std::set<T> &v) {
  bool first = true;
  os << "[";
  for (typename std::set<T>::const_iterator ii = v.begin(); ii != v.end();
       ++ii) {
    if (!first) os << ", ";
    os << *ii;
    first = false;
  }
  return os << "]";
}
template <typename T1, typename T2>
inline std::ostream &operator<<(std::ostream &os, const std::map<T1, T2> &v) {
  bool first = true;
  os << "[";
  for (typename std::map<T1, T2>::const_iterator ii = v.begin(); ii != v.end();
       ++ii) {
    if (!first) os << ", ";
    os << *ii;
    first = false;
  }
  return os << "]";
}
template <typename T, typename T2>
void printarray(T a[], T2 sz, T2 beg = 0) {
  for (T2 i = beg; i < sz; i++) cout << a[i] << " ";
  cout << endl;
}
inline long long powmod(long long x, long long n, long long _mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = (res * x) % _mod;
    x = (x * x) % _mod;
    n >>= 1;
  }
  return res;
}
inline long long gcd(long long a, long long b) {
  long long t;
  while (b) {
    a = a % b;
    t = a;
    a = b;
    b = t;
  }
  return a;
}
inline int gcd(int a, int b) {
  int t;
  while (b) {
    a = a % b;
    t = a;
    a = b;
    b = t;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long gcd(long long a, long long b, long long c) {
  return gcd(gcd(a, b), c);
}
inline int gcd(int a, int b, int c) { return gcd(gcd(a, b), c); }
template <class T>
inline void getar(T a, int n, int m) {
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; ++j) {
      scanf("%d", &a[i][j]);
    }
}
inline void getar(int *a, int n) {
  for (int ii = 0; ii < n; ii++) {
    scanf("%d", a + ii);
  }
}
inline void getar(pair<int, int> *a, int n) {
  for (int ii = 0; ii < n; ii++) {
    scanf("%d%d", &a[ii].first, &a[ii].second);
  }
}
inline void getar(long long *a, int n) {
  for (int ii = 0; ii < n; ii++) {
    scanf("%I64d", a + ii);
  }
}
template <class T>
inline void cinarr(T &a, int n) {
  for (int i = 0; i < n; ++i) cin >> a[i];
}
int read_int() {
  const int BUSFIZE = 4096;
  static char inbuf[BUSFIZE + 16];
  static char *inp = inbuf;
  static char *linp = inbuf + BUSFIZE;
  if (*inp == 0) {
    memset(inbuf, 0, BUSFIZE);
    cin.read(inbuf, BUSFIZE);
    inp = inbuf;
  }
  while (*inp && (*inp < '0' || *inp > '9')) ++inp;
  int res = 0;
  while (*inp >= '0' && *inp <= '9') {
    res = res * 10 + *inp - '0';
    ++inp;
    if (inp == linp) {
      memset(inbuf, 0, BUSFIZE);
      cin.read(inbuf, BUSFIZE);
      inp = inbuf;
    }
  }
  ++inp;
  return res;
}
char __attribute__((aligned(16))) s[100100];
unsigned char __attribute__((aligned(16))) s1[50100];
unsigned char __attribute__((aligned(16))) s2[50100];
unsigned char pack(unsigned char a, unsigned char b) { return a | (b << 4); }
const unsigned char secondMask = (15 << 4);
const unsigned char firstMask = 15;
void setFirst(unsigned char &c, unsigned char val) {
  c = (c & secondMask) | val;
}
void setSecond(unsigned char &c, unsigned char val) {
  c = (c & firstMask) | (val << 4);
}
int getChar(unsigned char *s, int pos) {
  if (pos & 1) {
    return (s[pos / 2] & secondMask) >> 4;
  } else {
    return s[pos / 2] & firstMask;
  }
}
void draw(unsigned char *s, int l, int r, char c) {
  if (l < 0) l = 0;
  ++r;
  if (r & 1) {
    setFirst(s[r / 2], c);
    --r;
  }
  if (l & 1) {
    setSecond(s[l / 2], c);
    ++l;
  }
  memset(s + l / 2, pack(c, c), r / 2 - l / 2);
}
bool areEqual(const unsigned char *s1, const unsigned char *s2, const int len) {
  return memcmp(s1, s2, len) == 0;
  const long long *a = (long long *)s1;
  const long long *b = (long long *)s2;
  int d = len / sizeof(long long);
  const int P = 8;
  int dP = d / P;
  ++dP;
  while (--dP) {
    if (a[0] != b[0]) break;
    if (a[1] != b[1]) break;
    if (a[2] != b[2]) break;
    if (a[3] != b[3]) break;
    if (a[4] != b[4]) break;
    if (a[5] != b[5]) break;
    if (a[6] != b[6]) break;
    if (a[7] != b[7]) break;
    a += P;
    b += P;
  }
  d %= P;
  ++d;
  while (--d) {
    if (*a != *b) break;
    ++a;
    ++b;
  }
  return d == 0 && dP == 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  int n, m, k;
  cin >> n >> m >> k;
  cin >> s;
  for (int i = 0; i < n; i++) {
    s[i] -= '0' - 1;
  }
  for (int i = 0; i < (n + 1) / 2; i++) {
    s1[i] = pack(s[i + i], s[i + i + 1]);
  }
  for (int i = 0; i < n / 2; i++) {
    s2[i] = pack(s[i + i + 1], s[i + i + 2]);
  }
  int tot = 0;
  for (int i = 0; i < m + k; i++) {
    int t;
    int l, r, c;
    t = read_int();
    l = read_int();
    r = read_int();
    c = read_int();
    --l;
    --r;
    if (t == 1) {
      draw(s1, l, r, c + 1);
      draw(s2, l - 1, r - 1, c + 1);
    } else {
      bool e = true;
      if (r - l + 1 > c) {
        const unsigned char *strA = l & 1 ? s2 + l / 2 : s1 + l / 2;
        const unsigned char *strB =
            (l + c) & 1 ? s2 + (l + c) / 2 : s1 + (l + c) / 2;
        int len = (r - l + 1 - c);
        e &= areEqual(strA, strB, len / 16 * 8);
        l += len / 16 * 16;
        len %= 16;
        for (int i = 0; i < len; ++i) {
          e &= getChar(s1, l + i) == getChar(s1, l + c + i);
        }
      }
      puts(e ? "YES" : "NO");
    }
  }
  return 0;
}