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

/**
 * Created by Anna on 17.10.2015.
 */

public class TaskE {
    StringTokenizer st;
    BufferedReader in;
    PrintWriter out;

    public static void main(String[] args) throws IOException {
        TaskE solver = new TaskE();
        solver.open();
        solver.solve();
        solver.close();
    }


    long MOD = (long) (1e9 + 7);
    long HASH_DEGREE = 13L;
    long[] hashDegrees = new long[(int) (1e5 + 1)];
    long[] hashSums = new long[(int) (1e5 + 1)];

    public void initHash() {
        hashDegrees[0] = 1;
        hashSums[0] = 1;
        for (int i = 1; i < hashDegrees.length; i++) {
            hashDegrees[i] = (hashDegrees[i - 1] * HASH_DEGREE) % MOD;
            hashSums[i] = (hashSums[i - 1] + hashDegrees[i]) % MOD;
        }
    }

    Node[] tree;

    private void solve() throws IOException {
        int n = nextInt();
        int m = nextInt();
        int k = nextInt();
        char[] initialString = nextToken().toCharArray();
        initHash();
        long[] charHash = new long[n];
        for (int i = 0; i < n; i++) {
            charHash[i] = /*hashDegrees[i] * */initialString[i];
        }

        tree = new Node[4 * n + 1];
        build(1, 0, n - 1, charHash);

        for (int i = 0; i < m + k; i++) {
            int type = nextInt();
            int left = nextInt() - 1;
            int right = nextInt() - 1;
            if (type == 1) {
                char newVal = nextToken().toCharArray()[0];
                update(1, 0, n - 1, left, right, newVal);
            } else {
                int dist = nextInt();
//                long valLStart = left > 0 ? getSum(1, 0, n - 1, 0, left - 1) : 0;
//                long valLFinish = getSum(1, 0, n - 1, 0, right - dist);
//                long valL = valLFinish - valLStart;
//                long valRStart = left + dist > 0 ? getSum(1, 0, n - 1, 0, left + dist - 1) : 0;
//                long valRFinish = getSum(1, 0, n - 1, 0, right);
//                long valR = valRFinish - valRStart;

                if (right - left + 1 <= dist) {
                    out.println("YES");
                } else {
                    long valL = getSum(1, 0, n - 1, left, right - dist);
                    long valR = getSum(1, 0, n - 1, left + dist, right);
                    if (valR == (valL * hashDegrees[dist]) % MOD )
                        out.println("YES");
                    else out.println("NO");

                }
            }
        }

    }

    private void build(int vertex, int treeLeft, int treeRight, long[] initialArray) {
        if (treeLeft == treeRight) {
            tree[vertex] = new Node(initialArray[treeLeft]);
            return;
        }

        int middle = (treeLeft + treeRight) / 2;
        build(2 * vertex, treeLeft, middle, initialArray);
        build(2 * vertex + 1, middle + 1, treeRight, initialArray);
        long left = tree[2 * vertex] == null ? 0 : tree[2 * vertex].value;
        long right = tree[2 * vertex + 1] == null ? 0 : tree[2 * vertex + 1].value;
        tree[vertex] = new Node((left + ((hashDegrees[middle - treeLeft + 1] * right) % MOD)) % MOD);
    }

    private long getSum(int vertex, int treeLeft, int treeRight, int queryLeft, int queryRight) {
        if (queryLeft > queryRight) return 0L;
        if (treeLeft == queryLeft && treeRight == queryRight) {
            return tree[vertex].value;
        }

        push(vertex, treeLeft, treeRight);
        int middle = (treeLeft + treeRight) / 2;
        long left = getSum(2 * vertex, treeLeft, middle, queryLeft, Math.min(middle, queryRight));
        long right = getSum(2 * vertex + 1, middle + 1, treeRight, Math.max(queryLeft, middle + 1), queryRight);

        return (left + ((hashDegrees[middle - treeLeft + 1] * right) % MOD)) % MOD;
    }

    private void push(int vertex, int treeLeft, int treeRight) {
        if (tree[vertex].color == 0) return;
        int middle = (treeLeft + treeRight) / 2;
        if (tree[2 * vertex] != null) {
            tree[2 * vertex].color = tree[vertex].color;
            tree[2 * vertex].value = (hashSums[middle - treeLeft] * tree[vertex].color) % MOD;
        }

        if (tree[2 * vertex + 1] != null) {
            tree[2 * vertex + 1].color = tree[vertex].color;
            tree[2 * vertex + 1].value = (hashSums[treeRight - middle - 1] * tree[vertex].color) % MOD;
        }

        tree[vertex].color = 0;
    }

    private void update(int vertex, int treeLeft, int treeRight, int queryLeft, int queryRight, char value) {
        if (queryLeft > queryRight) return;
        if (treeLeft == queryLeft && treeRight == queryRight) {
            tree[vertex].color = value;
            tree[vertex].value = (hashSums[treeRight - treeLeft] * tree[vertex].color) % MOD;
            return;
        }
        push(vertex, treeLeft, treeRight);
        int middle = (treeLeft + treeRight) / 2;
        update(2 * vertex, treeLeft, middle, queryLeft, Math.min(middle, queryRight), value);
        update(2 * vertex + 1, middle + 1, treeRight, Math.max(queryLeft, middle + 1), queryRight, value);
        long left = tree[2 * vertex] == null ? 0 : tree[2 * vertex].value;
        long right = tree[2 * vertex + 1] == null ? 0 : tree[2 * vertex + 1].value;
        tree[vertex].value = (left + ((hashDegrees[middle - treeLeft + 1] * right) % MOD)) % MOD;
    }

    class Node {
        long value;
        char color = 0;

        public Node(long value) {
            this.value = value;
        }
    }

    private void close() {
        out.close();
    }

    private void open() throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
    }

    private String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String str = in.readLine();
            if (str == null) return null;
            st = new StringTokenizer(str);
        }
        return st.nextToken();
    }

    private int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    private long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    private double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}