Given two string str1 and str2(of lower case alphabets) of same length. Find the longest prefix of str1 which is common in str2 as well. Print the index at which the longest common prefix of str1 is found in str2 and the longest common prefix with spaces in between.

NOTE: If there is no common prefix then print "-1".

INPUT: First line of the input is T denoting the number of test cases. Each test case takes two strings as input.

OUTPUT: Print the index from where the longest common prefix of str1 is found in str2 and the longest common prefix with a space in between.

CONSTRAINTS:
1<=T<=100
1<=Length of strings<10000

Examples:
INPUT:
2
geeks
dgeek
practicegeeks
coderpractice

OUTPUT:
1 geek
5 practice