\begin{problem}{Points and Lines}{\textsl{standard input}}{\textsl{standard output}}{1 second}{512 mebibytes}{}

One day, you found an old scroll with strange texts on it.

You revealed that the text was actually an expression denoting the position of
the hidden treasure.  The expression consists of following three operations:

\begin{itemize}
\item  From two points, yield a line on which the points lie.
\item  From a point and a line, yield a point that is symmetric to the given point with respect to the line.
\item  From two lines, yield a point that is the intersection of the lines.

\end{itemize}

The syntax of the expression is denoted by following BNF:

\footnotesize{
\begin{verbatim}
<expression>      ::= <point>
<point> ::= <point-factor> | <line> "@" <line-factor> | <line> "@" <point-factor> | <point> "@" <line-factor>
<point-factor>    ::= "(" <number> "," <number> ")" | "(" <point> ")"
<line>            ::= <line-factor> | <point> "@" <point-factor>
<line-factor>     ::= "(" <line> ")"
<number>          ::= <zero-digit> | <positive-number> | <negative-number>
<positive-number> ::= <nonzero-digit> | <positive-number> <digit>
<negative-number> ::= "-" <positive-number>
<digit>           ::= <zero-digit> | <nonzero-digit>
<zero-digit>      ::= "0"
<nonzero-digit>   ::= "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9"
\end{verbatim}
}

Each <point> or <point-factor> denotes a point, whereas each <line> or <line-factor> denotes a line.  The former notion of <point-factor> $(X,Y)$ represents a point which has $X$ for $x$-coordinate and $Y$ for $y$-coordinate on the $2$-dimensional plane.
``\texttt{@}'' indicates the operations on two operands.  Since each operation is distinguishable from others by its operands' types (i.e. a point or a line),
all of these operations are denoted by the same character ``\texttt{@}''. 
Note that ``\texttt{@}'' is left-associative, as can be seen from the BNF.

Your task is to determine where the treasure is placed.


\InputFile

The input consists of multiple datasets.  Each dataset is a single line which
contains an expression denoting the position of treasure.

It is guaranteed that each dataset satisfies the following conditions:


\begin{itemize}
\item  The length of the string never exceeds $10^2$.
\item  If both operands of ``\texttt{@}'' are points, their distance is greater than $1$.
\item  If both operands of ``\texttt{@}'' are lines, they are never parallel.
\item  The absolute values of points' coordinates never exceed $10^2$ at any point of evaluation.
\end{itemize}

You can also assume that there are at most $100$ datasets.

The input ends with a line that contains only a single ``\texttt{\#}''.


\OutputFile

For each dataset, print the $X$ and $Y$ coordinates of the point, denoted by
the expression, in this order.

The output will be considered correct if its absolute or relative error is at most $10^{-2}$.

\Examples
\begin{example}
\exmp{
((0,0)@(1,1))@((4,1)@(2,5))
((0,0)@(3,1))@((1,-3)@(2,-1))
(0,0)@(1,1)@(4,1)
(0,0)@((1,1)@(4,1))
(((0,0)@((10,20)@(((30,40))))))
((0,0)@(3,1))@((1,-3)@(2,-1))@(100,-100)@(100,100)
\#
}{
3.00000000 3.00000000
3.00000000 1.00000000
1.00000000 4.00000000
0.00000000 2.00000000
-10.00000000 10.00000000
-99.83681795 -91.92248853
}%
\end{example}
\end{problem}
