Medium Accuracy: 39.8% Submissions: 8228 Points: 4

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.