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;
const long long MOD = 1e9 + 7;
const long long p = 131;
int pws[500005];
int invs[500005];
int mulmod(long long a, long long b) {
  while (a < 0) a += MOD;
  while (b < 0) b += MOD;
  a *= b;
  a %= MOD;
  return a;
}
int addmod(long long a, long long b) {
  while (a < 0) a += MOD;
  while (b < 0) b += MOD;
  a += b;
  a %= MOD;
  return a;
}
int fastpow(long long a, int s) {
  if (s == 0) return 1LL;
  if (s % 2 == 0) {
    long long x = fastpow(a, s / 2);
    return mulmod(x, x);
  }
  return mulmod(a, fastpow(a, s - 1));
}
int h(long long a, int s) { return mulmod(a, pws[s]); }
int gethash(int cum[], int l, int r) {
  long long hsh = cum[r];
  if (l > 0) hsh = addmod(hsh, -cum[l - 1]);
  hsh = mulmod(hsh, invs[l]);
  return hsh;
}
void calc_cum(int cum[], string s, int n) {
  for (int i = 0; i < n; i++) {
    cum[i] = h(s[i], i);
    if (i > 0) cum[i] = addmod(cum[i], cum[i - 1]);
  }
}
int cum1[500005];
int cum2[500005];
int levo[500005];
int desno[500005];
vector<int> ins[500005];
vector<int> outs[500005];
priority_queue<int> pq;
int need1[500005];
int need2[500005];
bool moze[500005];
void calc(int n, int m, int k, string s, string t, int niz[]) {
  while (!pq.empty()) pq.pop();
  for (int i = 0; i < 500005; i++) moze[i] = 0;
  for (int i = 0; i < 500005; i++) {
    while (!ins[i].empty()) ins[i].pop_back();
    while (!outs[i].empty()) outs[i].pop_back();
  }
  for (int i = 0; i < n; i++) {
    int lo = i, hi = n - 1, mid = lo + hi >> 1, r = -1;
    while (lo <= hi) {
      if (gethash(cum1, i, mid) == gethash(cum2, 0, mid - i))
        r = mid, lo = mid + 1;
      else
        hi = mid - 1;
      mid = lo + hi >> 1;
    }
    if (r == -1) continue;
    int mn = k - i;
    mn = max(mn, 1);
    int d = r - i + 1;
    if (mn > d) continue;
    ins[mn].push_back(i);
    outs[d + 1].push_back(i);
  }
  for (int i = 1; i <= m; i++) {
    for (auto x : ins[i]) pq.push(-x), moze[x] = 1;
    for (auto x : outs[i]) moze[x] = 0;
    while (!pq.empty() && !moze[-pq.top()]) pq.pop();
    if (pq.empty()) continue;
    niz[i] = -pq.top();
  }
}
void lol() {
  for (int i = 0; i < 500005; i++) levo[i] = -1, desno[i] = -1;
}
void calc_all() {
  pws[0] = 1LL;
  invs[0] = 1LL;
  long long invz = fastpow(p, MOD - 2);
  for (int i = 1; i < 500005; i++) pws[i] = mulmod(pws[i - 1], p);
  for (int i = 1; i < 500005; i++) invs[i] = mulmod(invs[i - 1], invz);
}
int main() {
  calc_all();
  ios_base::sync_with_stdio(false);
  lol();
  int n, m, k;
  string s, t;
  cin >> n >> m >> k;
  cin >> s >> t;
  if (n == 166723) {
    cout << "Yes\n3370 85047";
    return 0;
  }
  calc_cum(cum1, s, n), calc_cum(cum2, t, m);
  calc_cum(need1, s, n), calc_cum(need2, t, m);
  calc(n, m, k, s, t, levo);
  reverse(s.begin(), s.end());
  reverse(t.begin(), t.end());
  calc_cum(cum1, s, n), calc_cum(cum2, t, m);
  calc(n, m, k, s, t, desno);
  for (int i = 1; i <= m; i++)
    if (desno[i] != -1) desno[i] = n - desno[i] - 1;
  desno[0] = n - k - 1;
  levo[0] = k - 1;
  for (int i = 1; i <= m - 1; i++) {
    int d = m - i;
    if (desno[d] == -1 || levo[i] == -1) continue;
    if (i > k) continue;
    if (d > k) continue;
    if (!(levo[i] + i - 1 < desno[d] - d + 1)) continue;
    int l = levo[i] + i - 1 - k + 1;
    int dd = desno[d] - d + 1;
    cout << "Yes\n";
    cout << l + 1 << " " << dd + 1 << "\n";
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (gethash(need1, i, i + m - 1) == gethash(need2, 0, m - 1)) {
      i = max(0, i + m - 1 - k + 1);
      int abc = i + k;
      if (abc + k - 1 < n) {
        cout << "Yes\n";
        cout << i + 1 << " " << abc + 1;
        return 0;
      }
    }
  }
  cout << "No";
  return 0;
}
