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.util.stream.IntStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.stream.Stream;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

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

    static class _955D {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();

            int k = in.nextInt();

            String s = in.next();
            String t = in.next();

            Kmp<Character> kmp1 = new Kmp<Character>(
                    s.chars().mapToObj(c -> (char) c).toArray(Character[]::new), t.chars().mapToObj(c -> (char) c).toArray(Character[]::new));

            kmp1.fail();
            kmp1.matches(k);
            kmp1.can();

            String sr = new StringBuilder(s).reverse().toString();
            String tr = new StringBuilder(t).reverse().toString();

            Kmp<Character> kmp2 = new Kmp<Character>(
                    sr.chars().mapToObj(c -> (char) c).toArray(Character[]::new), tr.chars().mapToObj(c -> (char) c).toArray(Character[]::new));


            kmp2.fail();
            kmp2.matches(k);
            kmp2.can();

            for (int i = 0; i <= m; i++) {
                int lai = kmp1.ans[i];

                int rai = kmp2.ans[m - i];

                if (i > k || m - i > k)
                    continue;

                int raia = n - 1 - rai;

                if (i == m && kmp1.sa != n) {
                    lai = Math.max(k - 1, kmp1.sa);
                    raia = n - k;
                } else if (m - i == m && kmp2.sa != n) {
                    lai = k - 1;
                    raia = Math.min(n - 1 - kmp2.sa, n - k);
                }
                if (lai < raia && lai - k + 1 >= 0 && raia + k - 1 < n) {

                    out.println("Yes");
                    out.print(lai + 1 - k + 1);
                    out.print(" ");
                    out.print(raia + 1);

                    return;
                }
            }

            out.println("No");
        }

        class Kmp<T extends Comparable<T>> {
            T[] s;
            T[] p;
            int n;
            int m;
            int[] f;
            int[] ans;
            int[] ansi;
            int sa;

            public Kmp(T[] s, T[] p) {
                super();
                this.s = s;
                this.p = p;
                this.n = s.length;
                this.m = p.length;
                this.f = new int[m];
                this.ans = new int[n + 1];
                for (int i = 1; i <= n; i++)
                    this.ans[i] = n;
                this.ansi = new int[n];
                this.sa = n;
            }

            void fail() {
                f[0] = -1;

                for (int i = 1; i < m; i++) {
                    int c = f[i - 1];

                    f[i] = -1;
                    while (c > -1) {
                        if (p[c + 1].equals(p[i])) {
                            f[i] = c + 1;
                            break;
                        } else {
                            c = f[c];
                        }
                    }

                    if (f[i] == -1) {
                        if (p[0].equals(p[i])) {
                            f[i] = 0;
                        }
                    }
                }
            }

            int matches(int k) {

                int matches = 0;

                int j = 0;
                for (int i = 0; i < n; i++) {
                    if (s[i].equals(p[j])) {
                        j++;
                        if (ans[j] == n && i >= k - 1) {
                            ans[j] = i;
                        }
                        if (j == m) {
                            if (sa == n) {
                                sa = i;
                            }
                            matches++;
                            j = f[j - 1] + 1;
                        }
                    } else {
                        while (j > 0 && !p[j].equals(s[i])) {
                            j = f[j - 1] + 1;
                        }

                        if (p[j].equals(s[i])) {
                            j++;
                            if (ans[j] == n && i >= k - 1) {
                                ans[j] = i;
                            }
                        }
                    }
                }

                return matches;
            }

            void can() {
                boolean[] vis = new boolean[m + 1];

                for (int i = m; i > 0; i--) {
                    if (!vis[i]) {
                        int p = i;
                        vis[p] = true;
                        int c = f[p - 1] + 1;
                        while (c > 0) {
                            ans[c] = Math.min(ans[p], ans[c]);
                            vis[c] = true;
                            p = c;
                            c = f[p - 1] + 1;
                        }
                    }
                }
            }

        }

    }

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

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

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

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

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

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

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public String next() {
            return nextString();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void println(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

        public void print(int i) {
            writer.print(i);
        }

    }
}

