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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskE {
        private final int Mod1 = (int) 1e9 + 7;
        private final int Mod2 = (int) 1e9 + 21;
        int[] pow10_1;
        int[] pow10_2;
        int[] spow10_1;
        int[] spow10_2;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int N = in.nextInt(), M = in.nextInt() + in.nextInt();
            String S = in.next();

            init(N);
            SegmentTree A = new SegmentTree(S);

            while (M-- > 0) {
                int type = in.nextInt();
                if (type == 1) {
                    int left = in.nextInt(), right = in.nextInt(), val = in.nextInt();
                    A.update(left - 1, right - 1, val);
                } else {
                    int left = in.nextInt() - 1, right = in.nextInt() - 1, d = in.nextInt();
                    Pairii real = A.query(left, right);
                    Pairii bucket = A.query(left, left + d - 1);
                    int cnt = (right - left + 1) / d, rem = (right - left + 1) % d;

                    int pw1 = calc(pow10_1[d], cnt, Mod1).first;
                    int pw2 = calc(pow10_2[d], cnt, Mod2).first;

                    int val1 = (int) ((long) pw1 * bucket.first % Mod1);
                    int val2 = (int) ((long) pw2 * bucket.second % Mod2);

                    if (rem != 0) {
                        Pairii hrem = A.query(left, left + rem - 1);
                        val1 = (int) (((long) val1 * pow10_1[rem] + hrem.first) % Mod1);
                        val2 = (int) (((long) val2 * pow10_2[rem] + hrem.second) % Mod2);
                    }

                    boolean ans = real.first == val1 && real.second == val2;
                    out.println(ans ? "YES" : "NO");
                }
            }
        /*System.err.println(calc(10, 2, Mod1).first);
        System.err.flush();*/
        }

        private Pairii calc(int val, int s, int Mod) {
            if (s == 1) return new Pairii(1, 1);

            if ((s & 1) == 1) {
                Pairii ret = calc(val, s - 1, Mod);
                int nv1 = (int) (((long) ret.first * val + 1) % Mod);
                int nv2 = (int) ((long) ret.second * val % Mod);
                ret.first = nv1;
                ret.second = nv2;
                return ret;
            } else {
                Pairii ret = calc(val, s / 2, Mod);
                int nv1 = (int) (((long) ret.first * ret.second % Mod * val + ret.first) % Mod);
                int nv2 = (int) ((long) ret.second * ret.second % Mod * val % Mod);
                ret.first = nv1;
                ret.second = nv2;
                return ret;
            }
        }

        private void init(int N) {
            pow10_1 = new int[N + 1];
            pow10_2 = new int[N + 1];
            spow10_1 = new int[N + 1];
            spow10_2 = new int[N + 1];

            pow10_1[0] = pow10_2[0] = 1;
            spow10_1[0] = spow10_2[0] = 1;
            for (int i = 1; i <= N; ++i) {
                pow10_1[i] = (int) (10L * pow10_1[i - 1] % Mod1);
                pow10_2[i] = (int) (10L * pow10_2[i - 1] % Mod2);

                spow10_1[i] = (spow10_1[i - 1] + pow10_1[i]) % Mod1;
                spow10_2[i] = (spow10_2[i - 1] + pow10_2[i]) % Mod2;
            }
        }

        private class SegmentTree {
            int[] tree1;
            int[] tree2;
            int[] lazy;
            int size;

            SegmentTree(String S) {
                size = S.length();
                tree1 = new int[size * 4];
                tree2 = new int[size * 4];
                lazy = new int[size * 4];
                Arrays.fill(lazy, -1);
                build(0, 0, size - 1, S);
            }

            private void build(int node, int left, int right, String S) {
                if (left == right) tree1[node] = tree2[node] = S.charAt(left) - '0';
                else {
                    int mid = (left + right) / 2;
                    build(2 * node + 1, left, mid, S);
                    build(2 * node + 2, mid + 1, right, S);
                    updateNode(node, left, right);
                }
            }

            private void split(int node, int left, int right) {
                if (lazy[node] == -1) return;
                if (left == right) {
                    tree1[node] = tree2[node] = lazy[node];
                } else {
                    tree1[node] = (int) ((long) spow10_1[right - left] * lazy[node] % Mod1);
                    tree2[node] = (int) ((long) spow10_2[right - left] * lazy[node] % Mod2);
                    lazy[2 * node + 1] = lazy[node];
                    lazy[2 * node + 2] = lazy[node];
                }
                lazy[node] = -1;
            }

            private void updateNode(int node, int left, int right) {
                int mid = (left + right) / 2;
                int sz = right - mid;
                tree1[node] = (int) (((long) tree1[2 * node + 1] * pow10_1[sz]
                        + tree1[2 * node + 2]) % Mod1);
                tree2[node] = (int) (((long) tree2[2 * node + 1] * pow10_2[sz]
                        + tree2[2 * node + 2]) % Mod2);
            }

            private void cupdate(int node, int left, int right, int lq, int rq, int val) {
                split(node, left, right);
                if (lq <= left && right <= rq) {
                    lazy[node] = val;
                } else {
                    int mid = (left + right) / 2;

                    if (lq <= mid) cupdate(2 * node + 1, left, mid, lq, rq, val);
                    split(2 * node + 1, left, mid);

                    if (rq > mid) cupdate(2 * node + 2, mid + 1, right, lq, rq, val);
                    split(2 * node + 2, mid + 1, right);

                    updateNode(node, left, right);
                }
            }

            private void cquery(int node, int left, int right, int lq, int rq, Pairii dest) {
                split(node, left, right);
                if (lq <= left && right <= rq) {
                    int sz = right - left + 1;
                    int nval1 = (int) (((long) dest.first * pow10_1[sz] + tree1[node]) % Mod1);
                    int nval2 = (int) (((long) dest.second * pow10_2[sz] + tree2[node]) % Mod2);
                    dest.first = nval1;
                    dest.second = nval2;
                } else {
                    int mid = (left + right) / 2;
                    if (lq <= mid) cquery(2 * node + 1, left, mid, lq, rq, dest);
                    if (rq > mid) cquery(2 * node + 2, mid + 1, right, lq, rq, dest);
                }
            }

            public void update(int left, int right, int val) {
                cupdate(0, 0, size - 1, left, right, val);
            }

            public Pairii query(int left, int right) {
                Pairii ret = new Pairii(0, 0);
                cquery(0, 0, size - 1, left, right, ret);
                return ret;
            }

        }

    }

    static class Pairii implements Comparable<Pairii> {
        public int first;
        public int second;

        public Pairii() {
        }

        public Pairii(int first, int second) {
            this.first = first;
            this.second = second;
        }

        public int compareTo(Pairii other) {
            if (first != other.first) return first < other.first ? -1 : 1;
            if (second != other.second) return second < other.second ? -1 : 1;
            return 0;
        }

        public boolean equals(Object other) {
            if (!(other instanceof Pairii)) return false;
            return compareTo((Pairii) other) == 0;
        }

        public int hashCode() {
            return first * 31 + second;
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }
}