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

Ibrahim Nash | 98 |

Stark_Maverick | 77 |

Eduardo Feo | 66 |

Micky_Kt | 62 |

Rohit Sharma 16 | 61 |

Lam Ngoc Pham | 463 |

All Is Well | 399 |

Divvya Sinha | 374 |

Prateek Gole | 369 |

Ibrahim Nash | 338 |

akhayrutdinov | 3855 |

sanjay05 | 3366 |

Michael Riegger | 2030 |

Jasleen Kaur 2 | 2012 |

Quandray | 1969 |