Alyona and Strings

有两种字符串s,t。长度分别为n,m。现在需要在s里面有序地选出k个子串，且在t中出现的顺序与这k个子串的顺序相同。问这k个子串最大的长度和。 n,m≤1000，k≤10 ------------ **输入** 输入的第一行包含三个整数n,m,k 输入的第二行包含字符串s，由小写英文字母组成。 输入的第三行包含字符串t，由小写英文字母组成。 ------------ **输出** 输出答案 ------------ 注:1、保证至少存在一个期望的序列。 2、图示为样例二的情况 ------------

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 $ p_{1},p_{2},p_{3},...,p_{k} $ satisfying following conditions: - $ s $ can be represented as concatenation $ a_{1}p_{1}a_{2}p_{2}...\ a_{k}p_{k}a_{k+1} $ , where $ a_{1},a_{2},...,a_{k+1} $ is a sequence of arbitrary strings (some of them may be possibly empty); - $ t $ can be represented as concatenation $ b_{1}p_{1}b_{2}p_{2}...\ b_{k}p_{k}b_{k+1} $ , where $ b_{1},b_{2},...,b_{k+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.

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.

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.

3 2 2
abc
ab

2

9 12 4
bbaaababb
abbbabbaaaba

7

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