#include <bits/stdc++.h>
using namespace std;
vector<int> z_algorithm(const vector<int>& S) {
  int N = S.size(), c = 0;
  vector<int> ret(N, 0);
  for (int i = 1; i < N; i++) {
    if (i + ret[i - c] < c + ret[c]) {
      ret[i] = ret[i - c];
    } else {
      int j = max(0, c + ret[c] - i);
      while (i + j < N && S[j] == S[i + j]) j++;
      ret[i] = j;
      c = i;
    }
  }
  ret[0] = N;
  return ret;
}
vector<int> z_algorithm(const string& S) {
  int N = S.size();
  vector<int> s(N);
  for (int i = 0; i < N; i++) s[i] = S[i];
  return z_algorithm(s);
}
vector<int> z_algorithm(string& A, string& B) {
  string S = A + '!' + B;
  auto z = z_algorithm(S);
  vector<int> ret(B.size());
  for (int i = 0; i < B.size(); i++) {
    ret[i] = z[i + A.size() + 1];
  }
  return ret;
}
template <typename T>
struct Segtree {
  int n;
  T e;
  vector<T> dat;
  typedef function<T(T a, T b)> Func;
  Func f;
  Segtree() {}
  Segtree(int n_input, Func f_input, T e_input) {
    initialize(n_input, f_input, e_input);
  }
  void initialize(int n_input, Func f_input, T e_input) {
    f = f_input;
    e = e_input;
    n = 1;
    while (n < n_input) n <<= 1;
    dat.resize(2 * n - 1, e);
  }
  void update(int k, T a) {
    k += n - 1;
    dat[k] = a;
    while (k > 0) {
      k = (k - 1) / 2;
      dat[k] = f(dat[2 * k + 1], dat[2 * k + 2]);
    }
  }
  T get(int k) { return dat[k + n - 1]; }
  T between(int a, int b) { return query(a, b + 1, 0, 0, n); }
  T query(int a, int b, int k, int l, int r) {
    if (r <= a || b <= l) return e;
    if (a <= l && r <= b) return dat[k];
    T vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
    T vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return f(vl, vr);
  }
};
int main() {
  int N, M, K;
  cin >> N >> M >> K;
  string S, T;
  cin >> S >> T;
  auto z1 = z_algorithm(T, S);
  for (int i = 0; i < N; i++)
    if (z1[i] == M) {
      int L = i;
      while (L + 2 * K - 1 >= N) L--;
      cout << "Yes" << endl;
      cout << L + 1 << " " << L + K + 1 << endl;
      return 0;
    }
  reverse(S.begin(), S.end());
  reverse(T.begin(), T.end());
  auto z2 = z_algorithm(T, S);
  reverse(z2.begin(), z2.end());
  pair<int, int> MIN = {-1e9, -1e9};
  Segtree<pair<int, int> > st(
      N, [](pair<int, int> a, pair<int, int> b) { return max(a, b); }, MIN);
  for (int i = 0; i < N; i++) st.update(i, {z2[i], i});
  for (int i = 0; i < N; i++) {
    int z = min(z1[i], K);
    if (i + z < K) continue;
    int L = i + z - K;
    int r = M - z;
    if (r > K) continue;
    auto p = st.between(L + K + max(0, r - 1), N - K + max(0, r - 1));
    if (p.first >= r) {
      int R = p.second - max(0, r - 1);
      cout << "Yes" << endl;
      cout << L + 1 << " " << R + 1 << endl;
      return 0;
    }
  }
  cout << "No" << endl;
  return 0;
}
