#include <bits/stdc++.h>
using namespace std;
const int N = 500005;
int n, m, k, ne[N], f[N], g[N];
char s[N], t[N];
signed main() {
  scanf("%d%d%d", &n, &m, &k);
  scanf("%s", s + 1);
  scanf("%s", t + 1);
  for (int i = 2, j = 0; i <= m; i++) {
    while (j && (j == k || t[j + 1] != t[i])) j = ne[j];
    if (t[j + 1] == t[i]) j++;
    ne[i] = j;
  }
  memset(f, 0x3f, sizeof f);
  for (int i = 1, j = 0; i <= n; i++) {
    while (j && (j == k || t[j + 1] != s[i])) j = ne[j];
    if (t[j + 1] == s[i]) j++;
    if (j == m) {
      puts("Yes");
      int l = max(1, i - k - k + 1);
      printf("%d %d\n", l, l + k);
      return 0;
    }
    if (i >= k) f[j] = min(f[j], i - k + 1);
  }
  for (int i = m; i; i--) f[ne[i]] = min(f[ne[i]], f[i]);
  reverse(s + 1, s + n + 1);
  reverse(t + 1, t + m + 1);
  for (int i = 2, j = 0; i <= m; i++) {
    while (j && (j == k || t[j + 1] != t[i])) j = ne[j];
    if (t[j + 1] == t[i]) j++;
    ne[i] = j;
  }
  for (int i = 1, j = 0; i <= n; i++) {
    while (j && (j == k || t[j + 1] != s[i])) j = ne[j];
    if (t[j + 1] == s[i]) j++;
    if (i >= k) g[j] = max(g[j], n - i + 1);
  }
  for (int i = m; i; i--) g[ne[i]] = max(g[ne[i]], g[i]);
  for (int i = 1; i <= m; i++)
    if (f[i] + k <= g[m - i]) {
      puts("Yes");
      printf("%d %d\n", f[i], g[m - i]);
      return 0;
    }
  puts("No");
}
