BVAAN  Balika Vadhu and Alok Nath
Anandi and Jagya were getting married again when they have achieved proper age. Dadi Sa invited Alok Nath to do the kanyadaan and give blessings. Alok Nath has 2 blessings. Each bessing is in the form of a string consisting of lowercase charaters(az) only. But he can give only one blessing of K length because some priest told him to do so. Thus he decides to generate a blessing using the other two blessings. While doing this he wants to ensure that happiness brought into their life by his blessing is maximum.
The generated blessing is a common subsequence of length K of the two blessings he has. Happiness of the blessing he generates is calculated by the sum of ASCII values of characters in the blessing and he wants the happiness to be maximum. If he is not able to generate a common subsequence of length K then the happiness is 0 (zero). Alok Nath comes to you and asks you to find the maximum happiness that can be generated by the two blessings he has.
Input Specification
First line consists of number of test cases t. Each test case consists of two strings b1 (blessing 1),b2 (blessing 2) and an integer K, each of them in separate lines.
Output Specification
Output consists of t lines each containing an integer denoting the maximum happiness value that can be generated by the two blessings.
Constraint
1 <= t <= 50
1 <= length(b1) , length(b2) <= 100
1 <= K <= 100
Sample Input
2
asdf
asdf
3
anandi
jagya
3
Sample Output
317
0
hide comments
sdeven_0245:
20180811 07:59:55
Easy problem 

akshitagarwal:
20180807 13:00:30
LCS and Reverse sorting the string obtained by backtracking what is the problem in this?? 

jvjplus:
20180615 07:59:33
my 1st 3d DP problem! 

dipankar12:
20180519 09:04:24
my 50th. 2nd 3D dp... :) 

bani_raheja:
20180201 20:38:36
such sanskar :') 

sriniakhil13:
20171030 14:43:52
20487581 getting wrong answer pls help.. 

sriniakhil13:
20171030 14:05:53
y cant we sort instead of knapsack becoz here all are of same weight if we think in terms of knapsack..?


shubham_001:
20170815 16:12:59
such a sanskari question 

vaibhavk31:
20170620 10:18:50
Last edit: 20170620 10:19:14 

babur:
20170611 07:30:36
Classical Dp problem must solve...:) 
Added by:  Sanket Singhal 
Date:  20150218 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 JSMONKEY 
Resource:  Own Problem(CQM 8 BIT Mesra) 