Time Limit: 5000MS    Memory Limit: 65536 K 


Description

Given three strings, find the length of the longest string which is a substring of each of the three input strings. In this problem "substring" has the usual definition. A string X is a substring of a string Y if and only if string X can be created from string Y by deleting zero or more consecutive characters from the start of string Y, and deleting zero or more consecutive characters from the end of string Y.

Input

The first line of the input is the number of test cases. For each case there is three lines each contains a string. The string only contains 'a'-'z' and up to 1000 characters long. There is a blank line before each test case.

Output

For each test case output the answer on a line.

Sample Input

3 aebcd ebcaddwerd fdsalebcser sdafawerrsdfsdfwe erfasdfafsd egreetsdwere aaaaa aaaaa aaaaa

Sample Output

3 2 5

Source