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>
std::string s;
std::string t;
uint32_t k;
std::vector<uint32_t> match_pos(const std::string &s, const std::string &pat) {
  std::vector<uint32_t> ans;
  ans.resize(pat.size() + 1);
  std::fill(ans.begin(), ans.end(), s.size());
  std::vector<uint32_t> kmpArr;
  kmpArr.reserve(pat.size() + 1);
  kmpArr.push_back(0);
  for (uint32_t i = 0; i < pat.size(); i++) {
    uint32_t p = kmpArr.back();
    while ((p > 0) && (pat[p] != pat[i])) {
      p = kmpArr[p];
    }
    if ((pat[p] == pat[i]) && (p < i)) {
      kmpArr.push_back(p + 1);
    } else {
      kmpArr.push_back(0);
    }
  }
  uint32_t curCnt = 0;
  for (uint32_t i = 0; i < s.size(); i++) {
    if (curCnt == pat.size()) {
      curCnt = kmpArr[curCnt];
    }
    while ((curCnt > 0) && (pat[curCnt] != s[i])) {
      curCnt = kmpArr[curCnt];
    }
    if (pat[curCnt] == s[i]) {
      curCnt++;
    } else {
      curCnt = 0;
    }
    if (i + 1 < k) {
      if (curCnt == pat.size()) {
        ans[curCnt] = std::min(ans[curCnt], k - 1);
      }
      continue;
    }
    uint32_t t = curCnt;
    while ((t > 0) && (ans[t] > i)) {
      ans[t] = i;
      t = kmpArr[t];
    }
    ans[t] = std::min(ans[t], i);
  }
  return ans;
}
void input() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  uint32_t sLen, tLen;
  std::cin >> sLen >> tLen >> k;
  s.reserve(sLen);
  t.reserve(tLen);
  std::cin >> s >> t;
}
template <class T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
  for (const T &i : v) {
    s << i << "; ";
  }
  return s;
}
int main() {
  input();
  std::vector<uint32_t> forw_arr = match_pos(s, t.substr(0, k));
  std::reverse(s.begin(), s.end());
  std::reverse(t.begin(), t.end());
  std::vector<uint32_t> rev_arr = match_pos(s, t.substr(0, k));
  for (uint32_t i = 0; i < forw_arr.size(); i++) {
    uint32_t j = t.size() - i;
    if (j >= rev_arr.size()) {
      continue;
    }
    if (forw_arr[i] + rev_arr[j] + 1 < s.size()) {
      std::cout << "Yes\n";
      std::cout << forw_arr[i] - k + 2 << " ";
      std::cout << s.size() - rev_arr[j] << "\n";
      return 0;
    }
  }
  std::cout << "No\n";
}
