SP3109 STRLCP - Longest Common Prefix

The LCP (Longest Common Prefix) of two strings A\[1..la\] and B\[1..lb\] is defined as follows: LCP(A\[1..la\],B\[1..lb\]) = max{L | L

The first line will be number of test cases T. The first line of each test case is a string S with length L (1

For each "Q i j" operation, print the answer.