#include <bits/stdc++.h>
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline void sub(long long &a, long long b) {
  a -= b;
  if (a < 0) a += 1000000009;
}
inline void add(long long &a, long long b) {
  a += b;
  if (a >= 1000000009) a -= 1000000009;
}
template <typename T>
inline T const &MAX(T const &a, T const &b) {
  return a > b ? a : b;
}
template <typename T>
inline T const &MIN(T const &a, T const &b) {
  return a < b ? a : b;
}
inline long long qp(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % 1000000009;
    a = a * a % 1000000009, b >>= 1;
  }
  return ans;
}
inline long long qp(long long a, long long b, long long c) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % c;
    a = a * a % c, b >>= 1;
  }
  return ans;
}
using namespace std;
const unsigned long long ba = 233;
const double eps = 1e-5;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int N = 200000 + 10, maxn = 1000000 + 10, inf = 0x3f3f3f3f;
char s[N], p[N];
int sa[N], t[N], t2[N], c[N], rk[N], height[N];
void buildSa(int n, int m) {
  int i, j = 0, k = 0, *x = t, *y = t2;
  for (i = 0; i < m; i++) c[i] = 0;
  for (i = 0; i < n; i++) c[x[i] = s[i]]++;
  for (i = 1; i < m; i++) c[i] += c[i - 1];
  for (i = n - 1; i >= 0; i--) sa[--c[x[i]]] = i;
  for (int k = 1; k < n; k <<= 1) {
    int p = 0;
    for (i = n - k; i < n; i++) y[p++] = i;
    for (i = 0; i < n; i++)
      if (sa[i] >= k) y[p++] = sa[i] - k;
    for (i = 0; i < m; i++) c[i] = 0;
    for (i = 0; i < n; i++) c[x[y[i]]]++;
    for (i = 1; i < m; i++) c[i] += c[i - 1];
    for (i = n - 1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
    swap(x, y);
    p = 1;
    x[sa[0]] = 0;
    for (int i = 1; i < n; i++) {
      if (y[sa[i - 1]] == y[sa[i]] && y[sa[i - 1] + k] == y[sa[i] + k])
        x[sa[i]] = p - 1;
      else
        x[sa[i]] = p++;
    }
    if (p >= n) break;
    m = p;
  }
  for (i = 1; i < n; i++) rk[sa[i]] = i;
  for (i = 0; i < n - 1; i++) {
    if (k) k--;
    j = sa[rk[i] - 1];
    while (s[i + k] == s[j + k]) k++;
    height[rk[i]] = k;
  }
}
int Log[N];
struct ST {
  int dp[N][20], ty;
  void build(int n, int b[], int _ty) {
    ty = _ty;
    for (int i = 1; i <= n; i++) dp[i][0] = ty * b[i];
    for (int j = 1; j <= Log[n]; j++)
      for (int i = 1; i + (1 << j) - 1 <= n; i++)
        dp[i][j] = max(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
  }
  int query(int x, int y) {
    int k = Log[y - x + 1];
    return ty * max(dp[x][k], dp[y - (1 << k) + 1][k]);
  }
} st;
int n, m, x;
int lcp(int x, int y) {
  x = rk[x], y = rk[y];
  if (x > y) swap(x, y);
  x++;
  return st.query(x, y);
}
int dp[100010][33];
int main() {
  for (int i = -(Log[0] = -1); i < N; i++)
    Log[i] = Log[i - 1] + ((i & (i - 1)) == 0);
  scanf("%d%s%d%s%d", &n, s, &m, p, &x);
  s[n] = 'z' + 1;
  for (int i = n + 1; i < n + 1 + m; i++) s[i] = p[i - n - 1];
  buildSa(n + m + 2, 258);
  st.build(n + m + 1, height, -1);
  dp[0][0] = 0;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= x; j++) {
      if (dp[i][j] == m) return 0 * puts("YES");
      dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
      if (j < x) {
        int lc = lcp(i, n + 1 + dp[i][j]);
        dp[i + lc][j + 1] = max(dp[i + lc][j + 1], dp[i][j] + lc);
      }
    }
  }
  puts("NO");
  return 0;
}
