#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int lps[N];
void computeLPS(string &pat) {
  int m = pat.length();
  int len = 0;
  lps[0] = 0;
  int i = 1;
  while (i < m) {
    if (pat[i] == pat[len]) {
      len++;
      lps[i] = len;
      i++;
    } else {
      if (len)
        len = lps[len - 1];
      else
        lps[i++] = 0;
    }
  }
}
vector<int> ans;
void Find(string &str, string &pat, int k, int fwd[]) {
  int n = str.length();
  int m = pat.length();
  int i, j;
  i = j = 0;
  while (i < n) {
    if (str[i] == pat[j]) {
      i++, j++;
      fwd[i] = j;
      if (j == k || j == m) {
        j = lps[j - 1];
        ans.push_back(i);
      }
    } else {
      if (j)
        j = lps[j - 1];
      else
        i++;
    }
  }
}
int fwd[N], bwd[N];
string s, t;
map<int, int> M;
set<int> adj[N];
int vis[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  cin >> s >> t;
  int ls = s.length(), lt = t.length();
  computeLPS(t);
  Find(s, t, k, fwd);
  if (lt < k) {
    for (auto it : ans) {
      if (it < k || it - lt > ls - k) {
        cout << "Yes\n";
        cout << 1 << " " << ls - k + 1 << "\n";
        return 0;
      }
    }
  }
  reverse(s.begin(), s.end());
  reverse(t.begin(), t.end());
  computeLPS(t);
  Find(s, t, k, bwd);
  reverse(s.begin(), s.end());
  reverse(t.begin(), t.end());
  reverse(bwd + 1, bwd + ls + 1);
  for (int i = ls - k + 1; i >= k; i--) {
    int lp = bwd[i];
    while (!vis[lp]) {
      M[lp]++;
      adj[i].insert(lp);
      vis[lp] = 1;
      if (lp == 0) break;
      lp = lps[lp - 1];
    }
  }
  for (int i = k; i <= ls - k; i++) {
    for (auto it : adj[i]) {
      M[it]--;
    }
    int len = fwd[i];
    if (M[lt - len]) {
      cout << "Yes\n";
      cout << i - k + 1 << " ";
      for (int j = i + 1; j <= ls - k + 1; j++) {
        if (adj[j].find(lt - len) != adj[j].end()) {
          cout << j << "\n";
          return 0;
        }
      }
      assert(false);
    }
  }
  cout << "No\n";
  return 0;
}
