Problem: Problem Statement

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 treasure. The expression consists of following three operations:

* From two points, yield a line on which the points lie.
* From a point and a line, yield a point that is symmetric to the given point with respect to the line.
* From two lines, yield a point that is the intersection of the lines.



The syntax of the expression is denoted by following BNF:


<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"

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. "@" 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 "@". Note that "@" is left-associative, as can be seen from the BNF.

Your task is to determine where the treasure is placed.

Input

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:

* The length of the string never exceeds $10^2$.
* If both operands of "@" are points, their distance is greater than $1$.
* If both operands of "@" are lines, they are never parallel.
* The absolute values of points' coordinates never exceed $10^2$ at any point of evaluation.



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

The input ends with a line that contains only a single "#".

Output

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}$.

Sample Input


((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)


Output for the Sample Input


3.00000000 3.00000000
3.00000000 1.00000000
1.00000000 4.00000000
0.00000000 2.00000000
-10.00000000 10.00000000
-99.83681795 -91.92248853





Example

Input

((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)
#


Output

3.00000000 3.00000000
3.00000000 1.00000000
1.00000000 4.00000000
0.00000000 2.00000000
-10.00000000 10.00000000
-99.83681795 -91.92248853

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
typedef complex<double> Complex;

struct data {
  bool line;
  Complex p, q;
};

string S;
ll p;

ll number() {
  ll sign = 1;
  if(S[p] == '-') {
    sign = -1;
    p++;
  }
  ll d = 0;
  while(p < S.length() && '0' <= S[p] && S[p] <= '9') {
    d = d * 10 + (S[p++] - '0');
  }
  return sign * d;
}

double det(Complex a, Complex b) {
  return a.real() * b.imag() - a.imag() * b.real();
}

Complex cross_point(Complex a, Complex b, Complex c, Complex d) {
  Complex u = b - a;
  Complex v = d - c;
  double p1 = u.imag(), q1 = -u.real(), r1 = -det(u, a);
  double p2 = v.imag(), q2 = -v.real(), r2 = -det(v, c);
  double t = p1 * q2 - p2 * q1;
  double x = (r1 * q2 - r2 * q1) / t;
  double y = (r2 * p1 - r1 * p2) / t;
  return Complex(x, y);
}

Complex opposite_point(Complex a, Complex p, Complex q) {
  Complex d = Complex((p - q).imag(), -(p - q).real());
  Complex s = cross_point(a, a + d, p, q);
  return a + (s - a) * 2.0;
}

data calc(data a, data b) {
  if(!a.line && !b.line) {
    return (data) { true, a.p, b.p };
  }
  if(a.line && b.line) {
    return (data) { false, cross_point(a.p, a.q, b.p, b.q) };
  }
  if(a.line && !b.line) swap(a, b);
  return (data) { false, opposite_point(a.p, b.p, b.q) };
}

data dfs() {
  data ret;
  if(S[p] != '(') {
    ret.line = false;
    ll x = number();
    p++;
    ll y = number();
    ret.p = Complex(x, y);
  } else {
    p++;
    ret = dfs();
    p++;
    while(p < S.length() && S[p] == '@') {
      p++;
      p++;
      data s = dfs();
      p++;
      ret = calc(ret, s);
    }
  }
  return ret;
}

int main(void) {
  while(cin >> S, S != "#") {
    p = 0;
    data ans = dfs();
    printf("%.15lf %.15lf\n", ans.p.real(), ans.p.imag());
  }
}