#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7;
int add(int a, int b) {
  if ((a += b) >= P) a -= P;
  return a;
}
int sub(int a, int b) {
  if ((a -= b) < 0) a += P;
  return a;
}
int mul(int a, int b) { return 1ll * a * b % P; }
int kpow(int a, int b) {
  int r = 1;
  for (; b; b >>= 1, a = mul(a, a)) {
    if (b & 1) r = mul(r, a);
  }
  return r;
}
const int N = 5e5 + 7;
int n, m, hs[N], ht[N], k, lpos, f[N], g[N];
string s, t;
void gethash() {
  for (int i = (1); i < (n + 1); i++)
    hs[i] = add(mul(hs[i - 1], 29), s[i - 1] - 'a' + 1);
  for (int i = (1); i < (m + 1); i++)
    ht[i] = add(mul(ht[i - 1], 29), t[i - 1] - 'a' + 1);
}
bool check(int l1, int r1, int l2, int r2) {
  int w1 = sub(hs[r1], mul(hs[l1 - 1], kpow(29, r1 - l1 + 1)));
  int w2 = sub(ht[r2], mul(ht[l2 - 1], kpow(29, r2 - l2 + 1)));
  return w1 == w2;
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  cin >> n >> m >> k;
  cin >> s >> t;
  gethash();
  fill_n(f, m + 1, n + 1);
  fill_n(g, m + 1, n + 1);
  lpos = k;
  f[0] = g[0] = k;
  for (int i = (1); i < (min(m, k) + 1); i++) {
    while (lpos <= n && !check(lpos - i + 1, lpos, 1, i)) lpos++;
    f[i] = lpos;
    if (check(k - i + 1, k, 1, i)) f[i] = k;
    lpos = f[i];
  }
  if (k >= m) {
    for (int i = (m); i < (k + 1); i++)
      if (check(i - m + 1, i, 1, m)) {
        f[m] = k;
        break;
      }
  }
  reverse(s.begin(), s.end());
  reverse(t.begin(), t.end());
  gethash();
  lpos = k;
  for (int i = (1); i < (min(m, k) + 1); i++) {
    while (lpos <= n && !check(lpos - i + 1, lpos, 1, i)) lpos++;
    g[i] = lpos;
    if (check(k - i + 1, k, 1, i)) g[i] = k;
    lpos = g[i];
  }
  if (k >= m) {
    for (int i = (m); i < (k + 1); i++)
      if (check(i - m + 1, i, 1, m)) {
        g[m] = k;
        break;
      }
  }
  for (int i = (0); i < (min(m, k) + 1); i++) {
    if (f[i] < n - g[m - i] + 1) {
      cout << "Yes\n";
      cout << f[i] - k + 1 << " " << n - g[m - i] + 1 << "\n";
      return 0;
    }
  }
  cout << "No";
  return 0;
}
