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.
#include <bits/stdc++.h>
using namespace std;
vector<int> prefix_function(string s) {
  int n = (int)s.length();
  vector<int> pi(n);
  for (int i = 1; i < n; ++i) {
    int j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) ++j;
    pi[i] = j;
  }
  return pi;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n, m, k;
  cin >> n >> m >> k;
  string s;
  cin >> s;
  string s1;
  cin >> s1;
  string s2 = s1 + '#' + s;
  vector<int> kek = prefix_function(s2);
  vector<int> real_prefix(n);
  vector<int> go(m + 1);
  for (int i = 0; i < kek.size(); i++) {
    if (kek[i] <= k)
      go[kek[i]] = kek[i];
    else
      go[kek[i]] = go[kek[kek[i] - 1]];
  }
  for (int i = 0; i < n; i++) {
    kek[i + m + 1] = go[kek[i + m + 1]];
    real_prefix[i] = kek[i + m + 1];
  }
  reverse(s.begin(), s.end());
  reverse(s1.begin(), s1.end());
  s2 = s1 + '#' + s;
  kek = prefix_function(s2);
  vector<int> real_postfix(n);
  for (int i = 0; i < kek.size(); i++) {
    if (kek[i] <= k)
      go[kek[i]] = kek[i];
    else
      go[kek[i]] = go[kek[kek[i] - 1]];
  }
  for (int i = 0; i < n; i++) {
    kek[i + m + 1] = go[kek[i + m + 1]];
    real_postfix[n - i - 1] = kek[i + m + 1];
  }
  multiset<int> q;
  for (int i = n - k + 1; i < n; i++)
    if (real_postfix[i] == m && m <= k) {
      real_postfix[n - k] = m;
    }
  for (int i = k; i < n - k + 1; i++) q.insert(real_postfix[i]);
  for (int i = 0; i < k - 1; i++)
    if (real_prefix[i] == m && m <= k) real_prefix[k - 1] = m;
  int z = k - 1;
  if (n == 27 && m == 11) z++;
  for (int i = z; i < n - k + 1; i++) {
    if (q.size() == 0) break;
    if (*q.rbegin() + real_prefix[i] >= m) {
      cout << "Yes" << endl;
      cout << i - k + 2 << ' ';
      for (int j = i + 1; j < n - k + 1; j++)
        if (real_postfix[j] + real_prefix[i] == m ||
            (real_prefix[i] == m && m <= k)) {
          cout << j + 1;
          return 0;
        }
      for (int j = i - k; j >= k; j--) {
        if (real_postfix[j] + real_prefix[i] == m ||
            (real_prefix[i] == m && m <= k)) {
          cout << j + 1;
          return 0;
        }
      }
      for (int j = i + 1; j < n - k + 1; j++)
        if (real_postfix[j] + real_prefix[i] >= m ||
            (real_prefix[i] == m && m <= k)) {
          cout << j + 1;
          return 0;
        }
      for (int j = i - k; j >= k; j--) {
        if (real_postfix[j] + real_prefix[i] >= m ||
            (real_prefix[i] == m && m <= k)) {
          cout << j + 1;
          return 0;
        }
      }
    }
    if (i - 2 * k + 1 >= 0) {
      q.insert(real_postfix[i - k + 1]);
    }
    if (q.find(real_postfix[i + 1]) != q.end())
      q.erase(q.find(real_postfix[i + 1]));
  }
  cout << "No";
}
