SPOJ in Gyumri

   You have been asked to write a program that can solve a linear equation.

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 member of the equation. All equations are composed of strings of less than 200 characters.

   Each line of each equation will be in the form of ax, followed by a single space, followed by a sign “+”, followed by a single space, followed by by, followed by a single space, followed by a sign “=”, followed by a single space, followed by c.

ax + by = c

where x and y are the variables (real number) and a, b, c are positive integers.

Output.

   For each data set, generate two lines of output. The first line will contain “Equation n” where n is the number of the data set. The second line will contain the following answer:

• If the equation has no solution, print "No solution.".
• If the equation has infinitely many solutions, print "More than one solution.".
• If the equation has exactly one solution for (x,y), print "x = solution1", followed by two spaces, followed by "y = solution2" where solution1 and solution2 are replaced by the appropriate reals numbers (printed to six decimals).

   Print a blank line after each data set case output.

Sample test.