#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
template <typename S, typename T>
inline bool Min(S &a, const T &b) {
  return a > b ? a = b, true : false;
}
template <typename S, typename T>
inline bool Max(S &a, const T &b) {
  return a < b ? a = b, true : false;
}
template <typename S, typename T>
inline void Adm(S &a, const T &b) {
  a = (a + b) % MOD;
  if (a < 0) a += MOD;
}
template <typename S, typename T>
inline void Mum(S &a, const T &b) {
  a = 1LL * a * b % MOD;
}
template <typename T>
inline bool IsPri(T x) {
  if (x < 2) return false;
  for (T i = 2; i * i <= x; ++i)
    if (x % i == 0) return false;
  return true;
}
template <typename T>
inline T Gcd(T a, T b) {
  while (b) {
    T t = b;
    b = a % b;
    a = t;
  }
  return a;
}
template <typename T>
inline int BitCnt(T x) {
  int cnt = 0;
  while (x) ++cnt, x &= x - 1;
  return cnt;
}
template <typename T>
inline T MDis(T x1, T y1, T x2, T y2) {
  return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T>
inline T MDis(T x1, T y1, T z1, T x2, T y2, T z2) {
  return abs(x1 - x2) + abs(y1 - y2) + abs(z1 - z2);
}
inline double EDis(double x1, double y1, double x2, double y2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
inline double EDis(double x1, double y1, double z1, double x2, double y2,
                   double z2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) +
              (z1 - z2) * (z1 - z2));
}
inline long long Pow(long long a, long long n) {
  long long t = 1;
  a %= MOD;
  while (n > 0) {
    if (n & 1) t = t * a % MOD;
    a = a * a % MOD, n >>= 1;
  }
  return t % MOD;
}
inline int read() {
  static char buf[1000000], *p1 = buf, *p2 = buf;
  register int x = false;
  register char ch =
      p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
          ? EOF
          : *p1++;
  ;
  register bool sgn = false;
  while (ch != '-' && (ch < '0' || ch > '9'))
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  if (ch == '-')
    sgn = true,
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  while (ch >= '0' && ch <= '9')
    x = (x << 1) + (x << 3) + (ch ^ 48),
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  return sgn ? -x : x;
}
const int N = 1e5 + 100;
char s[N], t[N];
int f[N][40];
struct StringHash {
  long long h[N], w[N], base, mod;
  int len;
  void Init(long long b, long long m) {
    h[0] = 0, w[0] = 1, base = b, mod = m, len = 0;
  }
  void Add(char c) {
    ++len;
    h[len] = (h[len - 1] * base + c) % mod, w[len] = w[len - 1] * base % mod;
  }
  long long Get(int l, int r) {
    return (h[r] - h[l - 1] * w[r - l + 1] % mod + mod) % mod;
  }
} hs, ht;
int main() {
  int n, m, x;
  scanf("%d%s", &n, s + 1);
  scanf("%d%s%d", &m, t + 1, &x);
  hs.Init(43, 1e9 + 7), ht.Init(43, 1e9 + 7);
  for (int i = 1; i <= n; ++i) hs.Add(s[i]);
  for (int i = 1; i <= m; ++i) ht.Add(t[i]);
  memset((f), (-0x3f), sizeof(f)), f[0][0] = 0;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < x; ++j)
      if (f[i][j] >= 0) {
        Max(f[i + 1][j], f[i][j]);
        int l = 1, r = min(n - i, m - f[i][j]), mx = 0;
        while (l <= r) {
          int mid = l + r >> 1;
          if (hs.Get(i + 1, i + mid) == ht.Get(f[i][j] + 1, f[i][j] + mid))
            l = mid + 1, mx = mid;
          else
            r = mid - 1;
        }
        if (mx) {
          if (f[i][j] + mx == m) puts("YES"), exit(0);
          Max(f[i + mx][j + 1], f[i][j] + mx);
        }
      }
  puts("NO");
  return 0;
}
