12504 - Updating a Dictionary

In this problem, a dictionary is collectionof key-value pairs, where keys are lower-case letters, and values arenon-negative integers. Given an old dictionary and a new dictionary, find outwhat were changed.

Each dictionary is formatting as follows:

{key:value,key:value,...,key:value}

Each key is a string of lower-case letters,and each value is a non-negative integer without leading zeros or prefix `+'.(i.e. -4, 03 and +77 are illegal). Each key will appear at most once, but keyscan appear in any order.

Input 

The first line contains the number of testcases T ( T1000). Each test casecontains two lines. The first line contains the old dictionary, and the secondline contains the new dictionary. Each line will contain at most 100 charactersand will not contain any whitespace characters. Both dictionaries could beempty.

WARNING: there are no restrictions on the lengths of each key and value inthe dictionary. That means keys could be really long and values could be reallylarge.

Output 

For each test case, print the changes,formatted as follows:

• First, if there are any new keys, print `+' and then the new keys in increasing order (lexicographically), separated by commas.
• Second, if there are any removed keys, print `-' and then the removed keys in increasing order (lexicographically), separated by commas.
• Last, if there are any keys with changed value, print `*' and then these keys in increasing order (lexicographically), separated by commas.

If the two dictionaries are identical,print `No changes' (without quotes) instead.

Print a blank line after each test case.

SampleInput 

3

{a:3,b:4,c:10,f:6}

{a:3,c:5,d:10,ee:4}

{x:1,xyz:123456789123456789123456789}

{xyz:123456789123456789123456789,x:1}

{first:1,second:2,third:3}

{third:3,second:2}

SampleOutput 

+d,ee

-b,f

*c

 

No changes

 

-first