You have two strings, a and $b.$ Find a string, s$.$ such that:

s can be expressed as $s=s_8+s_b$ where $s_4$ is a non$-$emply substring of a and $s_6$ is a non$-$empty rubstring of $b.$

s is a palindromic string.

The length of s is as long as possible.

For each of the $q$ pairs of strings $i{a}_7$ and $($:$b_i\}$ received as input, find and print string $s_q$ on a new line. If you'se able to form more than one valid string s$.,$ print whichever one comes first alphabetically. if there is no waid answer, print $-1$ instead.

Input Format

The first line convains a tingle integer, of denoting the number of quenes the subsequent fines descrite each query over two lines:

The first fine contains a sogle string denating a$.$

The secono fine contains a single string denoung b$.$

Constraims

$1210$

$*1$lan