Help!

Time Limit: 1 Second    Memory Limit: 32768 KB
Special Judge

MegaFirm Inc. has created a set of patterns to aid its telephone help-desk operators in responding to customers. A pattern is a phrase consisting of words and placeholders. A word is simply a string of letters. A placeholder is a word enclosed in angle brackets (that is < ... >). A phrase matches a pattern if each placeholder in the pattern can be systematically replaced by a word so as to make the pattern and phrase equal. By "systematically replaced" we mean that all placeholders enclosing the same word are replaced by the same word.

For example, the phrase

  to be or not to be

matches the pattern

   be not

because we can replace by to, by or, and by be.

Given two patterns, you are to find a phrase that matches both.

Input

The first line of input contains n, the number of test cases. Each test case consists of two lines of input; each a pattern. Patterns consist of lowercase words, and placeholders containing lowercase words. No pattern exceeds 100 characters. Words contain at most 16 characters. A single space separates adjacent words and placeholders.

Output

For each test case, output a phrase that matches both patterns. If several phrases match, any will do. If no phrase matches, output a line containing "-" (a single minus sign).

Sample Input

3
how now brown 
 now  cow
who are you

 b
c 

Sample Output

how now brown cow
-
c b

Submit

Source: University of Waterloo Local Contest 2004.09.25