#include <bits/stdc++.h>
using namespace std;
int inf_int = 2e9;
long long inf_ll = 2e18;
const double pi = 3.1415926535898;
template <typename T, typename T1>
void prin(vector<pair<T, T1> >& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i].first << " " << a[i].second << "\n";
  }
}
template <typename T>
void prin(vector<T>& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i];
    if (i < a.size() - 1)
      cout << " ";
    else
      cout << "\n";
  }
}
template <typename T>
void prin(set<T>& a) {
  for (auto it = a.begin(); it != a.end(); it++) {
    cout << *it << " ";
  }
}
template <typename T>
void prin_new_line(vector<T>& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i] << "\n";
  }
}
template <typename T, typename T1>
void prin_new_line(vector<pair<T, T1> >& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i].first << " " << a[i].second << "\n";
  }
}
int sum_vec(vector<int>& a) {
  int s = 0;
  for (int i = 0; i < a.size(); i++) {
    s += a[i];
  }
  return s;
}
template <typename T>
T max(vector<T>& a) {
  T ans = a[0];
  for (int i = 1; i < a.size(); i++) {
    ans = max(ans, a[i]);
  }
  return ans;
}
template <typename T>
T min(vector<T>& a) {
  T ans = a[0];
  for (int i = 1; i < a.size(); i++) {
    ans = min(ans, a[i]);
  }
  return ans;
}
template <typename T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
template <typename T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
long double s_triangle(long double x1, long double y1, long double x2,
                       long double y2, long double x3, long double y3) {
  return abs(((x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1)) / 2);
}
bool overflow(long long a, long long b) {
  if (a * b / b != a) return true;
  return false;
}
bool debug = 0;
const int maxn = 2e5 + 200;
long long mod = 1e9 + 7;
long long mxlen[1100][1100];
int dp[1100][1100][15];
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  string a, b;
  cin >> a >> b;
  a = "#" + a;
  b = "!" + b;
  for (int i = 1; i <= n; i++) {
    for (int e = 1; e <= m; e++) {
      if (a[i] == b[e]) {
        mxlen[i][e] = mxlen[i - 1][e - 1] + 1;
      } else {
        mxlen[i][e] = 0;
      }
    }
  }
  for (int i = 0; i <= n; i++) {
    for (int e = 0; e <= m; e++) {
      for (int f = 1; f <= k; f++) {
        dp[i][e][f] = -inf_int;
      }
    }
  }
  for (int f = 1; f <= k; f++)
    for (int i = 1; i <= n; i++) {
      for (int e = 1; e <= m; e++) {
        int len = mxlen[i][e];
        if (len) {
          dp[i][e][f] = max(dp[i - 1][e][f], dp[i][e - 1][f],
                            dp[i - len][e - len][f - 1] + len);
          for (int g = 1; g < len && g < 5; g++) {
            dp[i][e][f] = max(dp[i - g][e - g][f - 1] + g, dp[i][e][f]);
          }
        } else {
          dp[i][e][f] = max(dp[i - 1][e][f], dp[i][e - 1][f]);
        }
      }
    }
  cout << dp[n][m][k];
}
int main() {
  if (!debug) {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  }
  int t = 1;
  while (t--) solve();
  return 0;
}
