SP10570 LONGCS - Longest Common Substring

Substrings are consecutive parts of a string. A problem usually solved with dynamic programming is to find the longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two strings. Your task is to find the length of the longest common substring of K strings.

The first line contains an integer T, the number of test cases (1

Output T lines, one for each test case, containing the required sequence, with a blank space between consecutive terms. It is guaranteed that all terms in the sequence are integers.