#include <bits/stdc++.h>
using namespace std;
const int h = 1299827;
const int mod = 1e9 + 7;
long long p[500005], sum1[500005], sum2[500005];
char s[500005], t[500005];
vector<int> add[500005], del[500005];
int pref[500005], suff[500005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  cin >> s + 1;
  cin >> t + 1;
  p[0] = 1;
  for (int i = 1; i <= n; i++) p[i] = p[i - 1] * h % mod;
  for (int i = 1; i <= n; i++) sum1[i] = (sum1[i - 1] + p[i] * s[i]) % mod;
  for (int i = 1; i <= m; i++) sum2[i] = (sum2[i - 1] + p[i] * t[i]) % mod;
  for (int i = 1; i <= n; i++) {
    int lo = 1, hi = min(k, min(m, n - i + 1)), r = 0;
    while (lo <= hi) {
      int mid = (lo + hi) / 2;
      long long s1 = (sum1[i + mid - 1] - sum1[i - 1] + mod) % mod *
                     p[n - (i + mid - 1)] % mod;
      long long s2 = sum2[mid] * p[n - mid] % mod;
      if (s1 == s2)
        r = mid, lo = mid + 1;
      else
        hi = mid - 1;
    }
    int l = min(m, max(1, k - i + 1));
    if (l <= r) {
      if (l == 1) {
        add[l].emplace_back(i - k + 1 - l);
        del[r].emplace_back(i - k + 1 - l);
      } else {
        add[l].emplace_back(1 - l);
        del[r].emplace_back(1 - l);
      }
    }
  }
  multiset<int> cur;
  for (int i = 1; i <= m; i++) {
    for (int j = 0; j < (int)(add[i]).size(); j++) {
      int k = add[i][j];
      cur.insert(k);
    }
    if (!cur.empty()) pref[i] = *cur.begin() + i;
    for (int j = 0; j < (int)(del[i]).size(); j++) {
      int k = del[i][j];
      cur.erase(cur.find(k));
    }
    add[i].clear();
    del[i].clear();
  }
  reverse(s + 1, s + 1 + n);
  reverse(t + 1, t + 1 + m);
  for (int i = 1; i <= n; i++) sum1[i] = (sum1[i - 1] + p[i] * s[i]) % mod;
  for (int i = 1; i <= m; i++) sum2[i] = (sum2[i - 1] + p[i] * t[i]) % mod;
  for (int i = 1; i <= n; i++) {
    int lo = 1, hi = min(k, min(m, n - i + 1)), r = 0;
    while (lo <= hi) {
      int mid = (lo + hi) / 2;
      long long s1 = (sum1[i + mid - 1] - sum1[i - 1] + mod) % mod *
                     p[n - (i + mid - 1)] % mod;
      long long s2 = sum2[mid] * p[n - mid] % mod;
      if (s1 == s2)
        r = mid, lo = mid + 1;
      else
        hi = mid - 1;
    }
    int l = min(m, max(1, k - i + 1));
    if (l <= r) {
      if (l == 1) {
        add[l].emplace_back(i - k + 1 - l);
        del[r].emplace_back(i - k + 1 - l);
      } else {
        add[l].emplace_back(1 - l);
        del[r].emplace_back(1 - l);
      }
    }
  }
  cur.clear();
  for (int i = 1; i <= m; i++) {
    for (int j = 0; j < (int)(add[i]).size(); j++) {
      int k = add[i][j];
      cur.insert(k);
    }
    if (!cur.empty()) suff[i] = *cur.begin() + i;
    for (int j = 0; j < (int)(del[i]).size(); j++) {
      int k = del[i][j];
      cur.erase(cur.find(k));
    }
    add[i].clear();
    del[i].clear();
  }
  if (pref[m] != 0 && pref[m] + k + k - 1 <= n) {
    printf("Yes\n");
    printf("%d %d\n", pref[m], pref[m] + k);
    return 0;
  }
  if (suff[m] != 0 && (n - suff[m] + 1) - k - k + 1 >= 1) {
    printf("Yes\n");
    printf("%d %d\n", (n - suff[m] + 1) - k - k + 1, (n - suff[m] + 1) - k + 1);
    return 0;
  }
  for (int i = 1; i <= m - 1; i++) {
    if (pref[i] != 0 && suff[m - i] != 0) {
      if ((n - suff[m - i] + 1) - k + 1 > pref[i] + k - 1) {
        printf("Yes\n");
        printf("%d %d\n", pref[i], (n - suff[m - i] + 1) - k + 1);
        return 0;
      }
    }
  }
  printf("No\n");
}
