#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int n, m, k, z[1000002], v[2][500002];
string second, t;
int main() {
  cin >> n >> m >> k;
  cin >> second >> t;
  memset(v, -1, sizeof(v));
  for (int h = 0; h < 2; h++) {
    string a = t + '$' + second;
    memset(z, 0, sizeof(z));
    vector<vector<int> > mx;
    mx.resize(m + 1);
    set<int> S;
    int st = 0, dr = 0;
    for (int i = 1; i < a.size(); i++) {
      if (i > dr) {
        st = dr = i;
        while (dr < a.size() && a[dr - st] == a[dr]) dr++;
        z[i] = dr - st;
        dr--;
      } else {
        int k = i - st;
        if (z[k] < dr - i + 1)
          z[i] = z[k];
        else {
          st = i;
          while (dr < a.size() && a[dr - st] == a[dr]) dr++;
          z[i] = dr - st;
          dr--;
        }
      }
    }
    for (int i = 0; i < n; i++) {
      mx[z[i + (m + 1)]].push_back(i);
      if (z[i + (m + 1)] >= m) {
        int x = min(i, n - 2 * k);
        int y = x + k;
        if (y >= n) continue;
        cout << "Yes\n";
        cout << x + 1 << " " << y + 1;
        return 0;
      }
    }
    for (int i = m; i > 0; i--) {
      for (auto it : mx[i]) S.insert(it);
      auto it = S.lower_bound(k - i);
      if (it != S.end()) v[h][i] = *it;
    }
    reverse(second.begin(), second.end());
    reverse(t.begin(), t.end());
  }
  for (int i = 1; i < m; i++) {
    if (i <= k && m - i <= k && v[0][i] != -1 && v[1][m - i] != -1) {
      int x = v[0][i] + i - 1, y = v[1][m - i] + (m - i) - 1;
      if (x + y >= n - 1) continue;
      cout << "Yes\n";
      cout << x - (k - 1) + 1 << " " << n - y;
      return 0;
    }
  }
  cout << "No";
  return 0;
}
