Jenya has recently acquired quite a useful tool — k-scissors for cutting strings. They are generally used for cutting out two non-intersecting substrings of length k from an arbitrary string s (its length should be at least 2·k in order to perform this operation) and concatenating them afterwards (preserving the initial order). For example, with the help of 2-scissors you can cut ab and de out of abcde and concatenate them into abde, but not ab and bc since they're intersecting.

It's a nice idea to test this tool before using it in practice. After looking through the papers, Jenya came up with two strings s and t. His question is whether it is possible to apply his scissors to string s such that the resulting concatenation contains t as a substring?

Input

The first line contains three integers n, m, k (2 ≤ m ≤ 2·k ≤ n ≤ 5·105) — length of s, length of t and the aforementioned scissors' parameter correspondingly.

The next two lines feature s and t consisting of lowercase latin letters.

Output

If there is no answer, print «No». 

Otherwise print «Yes» and two integers L and R denoting the indexes where cutted substrings start (1-indexed). If there are several possible answers, output any.

Examples

Input

7 4 3
baabaab
aaaa


Output

Yes
1 5


Input

6 3 2
cbcbcb
bcc


Output

Yes
2 5


Input

7 5 3
aabbaaa
aaaaa


Output

No

Note

In the first sample case you can cut out two substrings starting at 1 and 5. The resulting string baaaab contains aaaa as a substring.

In the second sample case the resulting string is bccb.
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

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

    static class TaskD {
        public void solve(int testNumber, FastReader in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            int K = in.nextInt();
            String s = in.nextString();
            String t = in.nextString();

            int n1m = n + 1 + m;
            String sr = new StringBuilder(s).reverse().toString();
            String tr = new StringBuilder(t).reverse().toString();
            int[] table = kmpTable(t + "$" + s, K);
            int[] rTable = kmpTable(tr + "$" + sr, K);

            for (int i = m + 1; i < n1m; ++i) {
                if (table[i] == m) {
                    out.println("Yes");
                    int l = i - 2 * m;
                    int r = l + K;
                    if (r + K > n) {
                        l -= (r + K - n);
                        r = n - K;
                    }
                    out.println((l + 1) + " " + (r + 1));
                    return;
                }
            }

            HashMap<Integer, Integer> left = new HashMap<>();
            HashMap<Integer, Integer> right = new HashMap<>();

            for (int i = m + K; i < n1m; ++i) {
                for (int j = table[i]; j > 0 && !left.containsKey(j); j = table[j - 1]) {
                    left.put(j, i - m);
                }
            }

            for (int i = m + K; i < n1m; ++i) {
                for (int j = rTable[i]; j > 0 && !right.containsKey(j); j = rTable[j - 1]) {
                    right.put(j, n + 1 - (i - m));
                }
            }

            for (int kl = 1, kr = m - 1; kl < m; ++kl, --kr) {
                if (left.getOrDefault(kl, 1000000) < right.getOrDefault(kr, -1)) {
                    out.println("Yes");
                    out.println((left.get(kl) - K + 1) + " " + (right.get(kr)));
                    return;
                }
            }

            out.println("No");
        }

        public static int[] kmpTable(String s, int K) {
            int n = s.length();
            int[] table = new int[n];
            for (int i = 1, j = 0; i < n; ++i) {
                while (j > 0 && s.charAt(i) != s.charAt(j))
                    j = table[j - 1];
                if (s.charAt(i) == s.charAt(j))
                    ++j;
                while (j > K)
                    j = table[j - 1];
                table[i] = j;
            }
            return table;
        }

    }

    static class FastReader {
        private InputStream stream;
        private byte[] buf = new byte[8192];
        private int curChar;
        private int pnumChars;

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

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

        public int nextInt() {
            int c = pread();
            while (isSpaceChar(c))
                c = pread();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = pread();
            }
            int res = 0;
            do {
                if (c == ',') {
                    c = pread();
                }
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = pread();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String nextString() {
            int c = pread();
            while (isSpaceChar(c))
                c = pread();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = pread();
            } while (!isSpaceChar(c));
            return res.toString();
        }

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

    }
}

