#include <bits/stdc++.h>
using namespace std;
const int maxn = 500000 + 10;
int n, m, k;
char s[maxn], t[maxn];
int tot, last;
int L[maxn], R[maxn];
int nxt[maxn];
int flag[maxn];
int main() {
  scanf("%d%d%d", &n, &m, &k);
  scanf("%s", s + 1);
  scanf("%s", t + 1);
  int p = m + 1;
  nxt[m] = m + 1;
  for (int i = m - 1; i >= 1; i--) {
    while (p != m + 1 && t[p - 1] != t[i]) p = nxt[p];
    if (t[p - 1] == t[i]) {
      p--;
      nxt[i] = p;
    } else
      nxt[i] = m + 1;
  }
  p = m + 1;
  for (int i = n; i >= 1; i--) {
    while (p != m + 1 && t[p - 1] != s[i]) p = nxt[p];
    if (t[p - 1] == s[i]) {
      p--;
      while (p != m + 1 && m - p + 1 > k) p = nxt[p];
      R[i] = m - p + 1;
      if (p == 1) p = nxt[p];
    } else
      R[i] = 0;
  }
  p = 0;
  nxt[1] = 0;
  for (int i = 2; i <= m; i++) {
    while (p && t[p + 1] != t[i]) p = nxt[p];
    if (t[p + 1] == t[i]) {
      p++;
      nxt[i] = p;
    } else
      nxt[i] = 0;
  }
  p = 0;
  for (int i = 1; i <= n; i++) {
    while (p && t[p + 1] != s[i]) p = nxt[p];
    if (t[p + 1] == s[i]) {
      p++;
      while (p && p > k) p = nxt[p];
      L[i] = p;
      if (p == m) p = nxt[p];
    } else {
      L[i] = 0;
    }
  }
  bool jud = 0;
  int pos = 0, pos1 = 0;
  for (int i = k + 1; i + k - 1 <= n; i++) {
    int q = L[i - 1];
    while (q && !flag[q]) {
      flag[q] = i - 1;
      q = nxt[q];
    }
    if (flag[m - R[i]]) {
      jud = 1;
      pos = flag[m - R[i]];
      pos1 = i;
      break;
    }
  }
  if (jud) {
    printf("Yes\n");
    printf("%d %d\n", pos - k + 1, pos1);
  } else {
    for (int i = 1; i <= n; i++) {
      if (L[i] == m) {
        jud = 1;
        pos = max(i, k);
        break;
      }
    }
    if (pos + k <= n)
      pos1 = pos + 1;
    else
      jud = 0;
    if (!jud) {
      for (int i = n; i >= 1; i--) {
        if (R[i] == m) {
          jud = 1;
          pos1 = min(n - k + 1, i);
          break;
        }
      }
      if (pos1 > k)
        pos = k;
      else
        jud = 0;
    }
    if (!jud)
      printf("No\n");
    else {
      printf("Yes\n");
      printf("%d %d\n", pos - k + 1, pos1);
    }
  }
  return 0;
}
