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.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.BufferedReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStreamReader;

/**
 * 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 {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt() + in.nextInt();
            char[] s = in.next().toCharArray();
            IntervalTree[] trees = new IntervalTree[]{
                    new IntervalTree(1000000007, 13, s),
                    new IntervalTree(1000000003, 17, s),
                    new IntervalTree(1000000009, 13, s)
            };

            for (int i = 0; i < m; ++i) {
                int type = in.nextInt();
                int l = in.nextInt() - 1;
                int r = in.nextInt() - 1;
                int c = in.nextInt();
                if (type == 1) {
                    fillInterval(l, r, (char) (c + '0'), trees);
                } else {
                    out.println(isKPeriod(l, r, c, trees) ? "YES" : "NO");
                }
            }
        }

        private void fillInterval(int l, int r, char c, IntervalTree[] trees) {
            for (IntervalTree tree : trees) {
                tree.fillInterval(l, r, c);
            }
        }

        private boolean isKPeriod(int l, int r, int k, IntervalTree[] trees) {
            if (k >= r - l + 1) {
                return true;
            }
            int length = r - l + 1 - k;
//        System.err.println(l + " " + (l + length - 1) + " " + (l + k) + " " + r);
            for (IntervalTree tree : trees) {
//            System.err.println(tree.getHashValue(l, l + length - 1) + " " + tree.getHashValue(l + k, r));
                if (tree.getHashValue(l, l + length - 1) != tree.getHashValue(l + k, r)) {
                    return false;
                }
            }
            return true;
        }

        private static class IntervalTree {
            private final int modulo;
            private final int coef;
            private char[] characters;
            private long[] hashValue;
            private int[] length;
            private int[] filled;
            private long[] power;
            private long[] powerSum;

            IntervalTree(int modulo, int coef, char[] string) {
                this.modulo = modulo;
                this.coef = coef;
                this.characters = string.clone();

                this.hashValue = new long[4 * string.length + 10];
                this.length = new int[hashValue.length];
                this.filled = new int[hashValue.length];

                this.power = new long[string.length + 1];
                this.powerSum = new long[string.length + 1];

                power[0] = powerSum[0] = 1;
                for (int i = 1; i < power.length; ++i) {
                    power[i] = power[i - 1] * coef % modulo;
                    powerSum[i] = (powerSum[i - 1] + power[i]) % modulo;
                }

                initIntervalTree(0, characters.length - 1, 1);
            }

            private void merge(int node) {
                hashValue[node] = (hashValue[node * 2] * power[length[node * 2 + 1]]
                        + hashValue[node * 2 + 1]) % modulo;
            }

            private void pushDown(int node) {
                if (filled[node] != -1) {
                    filled[2 * node] = filled[2 * node + 1] = filled[node];
                    hashValue[2 * node] = filled[node] * powerSum[length[2 * node] - 1] % modulo;
                    hashValue[2 * node + 1] = filled[node] * powerSum[length[2 * node + 1] - 1] % modulo;
                    filled[node] = -1;
                }
            }

            private void initIntervalTree(int left, int right, int node) {
                length[node] = right - left + 1;
                filled[node] = -1;
                if (left == right) {
                    hashValue[node] = characters[left] - '0' + 1;
                    return;
                }
                int mid = (left + right) >> 1;
                initIntervalTree(left, mid, node * 2);
                initIntervalTree(mid + 1, right, node * 2 + 1);
                merge(node);
            }

            private void fillInterval(int left, int right, int l, int r, int node, char c) {
                if (l <= left && r >= right) {
                    filled[node] = c - '0' + 1;
                    hashValue[node] = powerSum[length[node] - 1] * filled[node] % modulo;
                    return;
                }

                pushDown(node);
                int mid = (left + right) >> 1;
                if (l <= mid) {
                    fillInterval(left, mid, l, r, node * 2, c);
                }
                if (r > mid) {
                    fillInterval(mid + 1, right, l, r, node * 2 + 1, c);
                }
                merge(node);
            }

            public void fillInterval(int left, int right, char c) {
                fillInterval(0, characters.length - 1, left, right, 1, c);
            }

            private long[] getHashValue(int left, int right, int l, int r, int node) {
                if (l <= left && r >= right) {
                    return new long[]{hashValue[node], right - left + 1};
                }
                pushDown(node);
                int mid = (left + right) >> 1;
                long[] result = new long[]{0, 0};
                if (l <= mid) {
                    result = getHashValue(left, mid, l, r, node * 2);
                }
                if (r > mid) {
                    long[] rightPart = getHashValue(mid + 1, right, l, r, node * 2 + 1);
                    result = new long[]{(result[0] * power[(int) rightPart[1]] + rightPart[0]) % modulo,
                            result[1] + rightPart[1]};
                }
                return result;
            }

            public long getHashValue(int left, int right) {
                return getHashValue(0, characters.length - 1, left, right, 1)[0];
            }

        }

    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (Exception e) {
                    throw new UnknownError();
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}