Write a program that decides whether two strings are the same string once presentation (output-format) differences are taken into account, or whether they are fundamentally different strings.
Every input string consists only of the following characters:
The special symbols are:
( ) [ ] { } . , ; :
Two strings are considered the same string apart from presentation according to the following rules:
(, [, {) are not distinguished from one another.), ], }) are not distinguished from one another., and a semicolon ; are not distinguished from each other.The first line contains the number of test cases $K$.
Each test case is then given over two lines: string $s_1$ followed by string $s_2$.
Each string has length at most $1000$, and no string contains a newline character.
For each test case, first print Data Set K: , where $K$ is the 1-based test-case number.
Then print equal if the two strings are the same once presentation is taken into account, or not equal if they are different strings no matter how the presentation is adjusted.
Print one blank line between consecutive test cases.