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.BufferedReader;
// import java.io.FileInputStream;
// import java.io.FileOutputStream;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;

import static java.lang.Math.min;
import static java.lang.Math.sqrt;
import static java.util.Arrays.copyOf;
import static java.util.Arrays.fill;
import static java.util.Arrays.sort;
import static java.util.Collections.reverseOrder;
import static java.util.Collections.sort;

public class Main {
    FastScanner in;
    PrintWriter out;

    private void solve() throws IOException {
        int ss = in.nextInt(), ts = in.nextInt(),
                sss = ss + ts + 1, k = in.nextInt();
        String s = in.next();
        String t = in.next();

        int[] pi = pi((t + "\0" + s).toCharArray(), k);

        for (int i = ts + 1; i < sss; i++) {
            if (pi[i] == ts) {
                out.println("Yes");
                int l = i - ts - ts, r = l + k;
                if (r + k > ss) {
                    l -= r + k - ss;
                    r = ss - k;
                }
                out.print((l + 1) + " " + (r + 1));
                return;
            }
        }

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

        int[] pir = pi((tr + "\0" + sr).toCharArray(), k);

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

        for (int i = ts + k; i < sss; i++) {
            for (int j = pi[i]; j > 0 && !left.containsKey(j); j = pi[j - 1]) {
                left.put(j, i - ts);
            }
        }

        for (int i = ts + k; i < sss; i++) {
            for (int j = pir[i]; j > 0 && !right.containsKey(j); j = pir[j - 1]) {
                right.put(j, ss + 1 - (i - ts));
            }
        }

        for (int kl = 1, kr = ts - 1; kl < ts; kl++, kr--) {
            if (left.getOrDefault(kl, (int) 1e6) < right.getOrDefault(kr, -1)) {
                out.println("Yes");
                out.print((left.get(kl) - k + 1) + " " + (right.get(kr)));
                return;
            }
        }

        out.println("No");
    }

    int[] pi(char[] s, int k) {
        int n = s.length, pi[] = new int[n];
        for (int i = 1, j = 0; i < n; i++) {
            while (j > 0 && s[i] != s[j])
                j = pi[j - 1];
            if (s[i] == s[j])
                j++;
            while (j > k)
                j = pi[j - 1];
            pi[i] = j;
        }
        return pi;
    }

    class FastScanner {
        StringTokenizer st;
        BufferedReader br;

        FastScanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        boolean hasNext() throws IOException {
            return br.ready() || (st != null && st.hasMoreTokens());
        }

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

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

        double nextDouble() throws IOException {
            return Double.parseDouble(next().replace(',', '.'));
        }

        String nextLine() throws IOException {
            return br.readLine();
        }

        boolean hasNextLine() throws IOException {
            return br.ready();
        }
    }

    private void run() throws IOException {
        in = new FastScanner(System.in); // new FastScanner(new FileInputStream(".in"));
        out = new PrintWriter(System.out); // new PrintWriter(new FileOutputStream(".out"));

        solve();

        out.flush();
        out.close();
    }

    public static void main(String[] args) throws IOException {
        new Main().run();
    }
}
