Problem B - Anagrams 
--------------------

An anagram is a word or phrase formed by rearranging the letters of
another word or phrase. For example, "carthorse" is an anagram of
"orchestra". Blanks within a phrase are ignored in forming anagrams.
Thus, "orchestra" and "horse cart" are also anagrams. Note that a phrase
is an anagram of itself.

Write a program that reads a list of phrases and prints all pairs of
anagrams occurring in the list.

Input
-----

The first line of the input will contain a single integer indicating the
number of test cases you need to test. The second line will be blank.
Each test case will consist of from 1 to 100 lines. A blank line signals
the end of a test case. Each line constitutes one phrase and will be at
most 255 characters long. All phrases will be in lower case.

Output
------

Some number of lines (including possibly 0 if there are no anagrams in
the list), each line containing two anagrammatic phrases separated by
'='.

Each anagram pair should be printed exactly once, and the order of the
output must be lexicographic, as shown in the sample output below.

After the output for each test case, output a blank line. If a test
case, contains no anagrams, only this blank line should be produced.

Sample Input
------------

3

carthorse
horse
horse cart
i do not know u
ok i now donut
orchestra

fire
ice

power
woper


Output for Sample Input
-----------------------

carthorse = horse cart
carthorse = orchestra
horse cart = orchestra
i do not know u = ok i now donut


power = woper