SPOJ in Gyumri

   For security reasons, it is advised that the return path of the president car should not be the same as the starting path.

   You have been asked to write a program that can tell if the return path is the same as the starting path.

Input.

   The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the number of data sets that follow. Each data set consists of two lines containing each, one path which is composed of strings of less than 200 characters. Each string is a name of town. There will not be more than 20 towns per path. The name of town will be case insensitive and will be a string formed with characters [a-z] [A-Z] and with the sign “-”

Output.

   For each data set, generate one line of output containing a single word “Same” if the starting path is same as the return path or “Different” if not.

Sample test.