BETA

Difficulty Level:

Easy

Total Submissions: 180 Accuracy:

46.11%

LCS of three strings
       

Given 3 strings X, Y and Z, the task is to find the longest common sub-sequence in all three given sequences.

 

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains integers n, m and k denoting the length of strings X, Y and Z respectively.

The second line of each test case contains the three strings X, Y and Z. The string consists of only lower case english alphabets.

Output:

Print the length of the longest common sub- sequence of the three strings for each test case in a new line.


Constraints:

1<= T <=100

1<= N, M, K <=100


Example:

Input:

1

5 8 13

geeks geeksfor geeksforgeeks

Output:

5

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.