#include <bits/stdc++.h>
using namespace std;
const int kN = 1000 + 1;
const int kK = 10 + 1;
const int kInf = 1e+9;
int dp[kN][kN][kK][2];
string s, t;
int DP(int n, int m, int k, int f) {
  if (k == 0) {
    return 0;
  }
  if (n == 0 || m == 0) {
    return 0;
  }
  if (dp[n][m][k][f] == -1) {
    dp[n][m][k][f] = max(DP(n - 1, m, k - f, 0), DP(n, m - 1, k - f, 0));
    if (s[n - 1] == t[m - 1]) {
      dp[n][m][k][f] = max(dp[n][m][k][f], DP(n - 1, m - 1, k, 1) + 1);
      dp[n][m][k][f] = max(dp[n][m][k][f], DP(n - 1, m - 1, k - 1, 0) + 1);
    }
  }
  return dp[n][m][k][f];
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  cin >> s >> t;
  memset(dp, 255, sizeof(dp));
  cout << DP(n, m, k, 0);
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

After returned from forest, Alyona started reading a book. She noticed strings s and t, lengths of which are n and m respectively. As usual, reading bored Alyona and she decided to pay her attention to strings s and t, which she considered very similar.

Alyona has her favourite positive integer k and because she is too small, k does not exceed 10. The girl wants now to choose k disjoint non-empty substrings of string s such that these strings appear as disjoint substrings of string t and in the same order as they do in string s. She is also interested in that their length is maximum possible among all variants.

Formally, Alyona wants to find a sequence of k non-empty strings p1, p2, p3, ..., pk satisfying following conditions:

  * s can be represented as concatenation a1p1a2p2... akpkak + 1, where a1, a2, ..., ak + 1 is a sequence of arbitrary strings (some of them may be possibly empty); 
  * t can be represented as concatenation b1p1b2p2... bkpkbk + 1, where b1, b2, ..., bk + 1 is a sequence of arbitrary strings (some of them may be possibly empty); 
  * sum of the lengths of strings in sequence is maximum possible. 



Please help Alyona solve this complicated problem and find at least the sum of the lengths of the strings in a desired sequence.

A substring of a string is a subsequence of consecutive characters of the string.

Input

In the first line of the input three integers n, m, k (1 ≤ n, m ≤ 1000, 1 ≤ k ≤ 10) are given — the length of the string s, the length of the string t and Alyona's favourite number respectively.

The second line of the input contains string s, consisting of lowercase English letters.

The third line of the input contains string t, consisting of lowercase English letters.

Output

In the only line print the only non-negative integer — the sum of the lengths of the strings in a desired sequence.

It is guaranteed, that at least one desired sequence exists.

Examples

Input

3 2 2
abc
ab


Output

2


Input

9 12 4
bbaaababb
abbbabbaaaba


Output

7

Note

The following image describes the answer for the second sample case:

<image>

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int kN = 1000 + 1;
const int kK = 10 + 1;
const int kInf = 1e+9;
int dp[kN][kN][kK][2];
string s, t;
int DP(int n, int m, int k, int f) {
  if (k == 0) {
    return 0;
  }
  if (n == 0 || m == 0) {
    return 0;
  }
  if (dp[n][m][k][f] == -1) {
    dp[n][m][k][f] = max(DP(n - 1, m, k - f, 0), DP(n, m - 1, k - f, 0));
    if (s[n - 1] == t[m - 1]) {
      dp[n][m][k][f] = max(dp[n][m][k][f], DP(n - 1, m - 1, k, 1) + 1);
      dp[n][m][k][f] = max(dp[n][m][k][f], DP(n - 1, m - 1, k - 1, 0) + 1);
    }
  }
  return dp[n][m][k][f];
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  cin >> s >> t;
  memset(dp, 255, sizeof(dp));
  cout << DP(n, m, k, 0);
  return 0;
}

```