Problem: Spinning tops are one of the most popular and the most traditional toys. Not only spinning them, but also making one’s own is a popular enjoyment.

One of the easiest way to make a top is to cut out a certain shape from a cardboard and pierce an axis stick through its center of mass. Professionally made tops usually have three dimensional shapes, but in this problem we consider only two dimensional ones.

Usually, tops have rotationally symmetric shapes, such as a circle, a rectangle (with 2-fold rotational symmetry) or a regular triangle (with 3-fold symmetry). Although such symmetries are useful in determining their centers of mass, they are not definitely required; an asymmetric top also spins quite well if its axis is properly pierced at the center of mass.

When a shape of a top is given as a path to cut it out from a cardboard of uniform thickness, your task is to find its center of mass to make it spin well. Also, you have to determine whether the center of mass is on the part of the cardboard cut out. If not, you cannot pierce the axis stick, of course.

Hints

An important nature of mass centers is that, when an object O can be decomposed into parts O1 , . . . , On with masses M1 , . . . , Mn , the center of mass of O can be computed by:

<image>

where Gk is the vector pointing the center of mass of Ok.

A circular segment with its radius r and angle θ (in radian) has its arc length s = rθ and its chord length c = r√(2 - 2cosθ). Its area size is A = r2(θ - sinθ)/2 and its center of mass G is y = 2r3sin3(θ/2)/(3A) distant from the circle center.

<image>

Figure 2: Circular segment and its center of mass

<image>

Figure 3: The first sample top



Input

The input consists of multiple datasets, each of which describes a counterclockwise path on a cardboard to cut out a top. A path is indicated by a sequence of command lines, each of which specifies a line segment or an arc.

In the description of commands below, the current position is the position to start the next cut, if any. After executing the cut specified by a command, the current position is moved to the end position of the cut made.

The commands given are one of those listed below. The command name starts from the first column of a line and the command and its arguments are separated by a space. All the command arguments are integers.


start x y


Specifies the start position of a path. This command itself does not specify any cutting; it only sets the current position to be (x, y).


line x y


Specifies a linear cut along a straight line from the current position to the position (x, y), which is not identical to the current position.


arc x y r


Specifies a round cut along a circular arc. The arc starts from the current position and ends at (x, y), which is not identical to the current position. The arc has a radius of |r|. When r is negative, the center of the circle is to the left side of the direction of this round cut; when it is positive, it is to the right side (Figure 1). The absolute value of r is greater than the half distance of the two ends of the arc. Among two arcs connecting the start and the end positions with the specified radius, the arc specified is one with its central angle less than 180 degrees.


close


Closes a path by making a linear cut to the initial start position and terminates a dataset. If the current position is already at the start position, this command simply indicates the end of a dataset.

The figure below gives an example of a command sequence and its corresponding path. Note that, in this case, the given radius -r is negative and thus the center of the arc is to the left of the arc. The arc command should be interpreted as shown in this figure and, not the other way around on the same circle.

<image>

Figure 1: A partial command sequence and the path specified so far

A dataset starts with a start command and ends with a close command.

The end of the input is specified by a line with a command end.

There are at most 100 commands in a dataset and at most 100 datasets are in the input. Absolute values of all the coordinates and radii are less than or equal to 100.

You may assume that the path does not cross nor touch itself. You may also assume that paths will never expand beyond edges of the cardboard, or, in other words, the cardboard is virtually infinitely large.

Output

For each of the dataset, output a line containing x- and y-coordinates of the center of mass of the top cut out by the path specified, and then a character ‘+’ or ‘-’ indicating whether this center is on the top or not, respectively. Two coordinates should be in decimal fractions. There should be a space between two coordinates and between the y-coordinate and the character ‘+’ or ‘-’. No other characters should be output. The coordinates may have errors less than 10-3 . You may assume that the center of mass is at least 10-3 distant from the path.

Example

Input

start 0 0
arc 2 2 -2
line 2 5
arc 0 3 -2
close
start -1 1
line 2 1
line 2 2
line -2 2
arc -3 1 -1
line -3 -2
arc -2 -3 -1
line 2 -3
line 2 -2
line -1 -2
line -1 -1
arc -1 0 2
close
start 0 0
line 3 0
line 5 -1
arc 4 -2 -1
line 6 -2
line 6 1
line 7 3
arc 8 2 -1
line 8 4
line 5 4
line 3 5
arc 4 6 -1
line 2 6
line 2 3
line 1 1
arc 0 2 -1
close
end


Output

1.00000 2.50000 +
-1.01522 -0.50000 -
4.00000 2.00000 +

Solution (in CPP):

Solution:
#include <iostream>
#include <algorithm>
#include <complex>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

typedef complex< double > Point;
typedef complex< double > Vector;
const double kEps = 1e-8;
const double kPi = acos(-1.0);

struct Arc {
  Point p1, p2;
  double r;

  Arc(const Point &rp1, const Point &rp2, double _r) {
    p1 = rp1, p2 = rp2, r = _r;
  }
};

struct Bow {
  Point p1, p2, po;
  double r, alph;

  Bow(const Point &rp1, const Point &rp2, const Point &rpo,
      double _r, double _alph) {
    p1 = rp1, p2 = rp2, po = rpo, r = _r, alph = _alph;
  }
};

string str;
vector< Point > v_pt;
vector< Arc > v_arc;
vector< Bow > v_bow;
Point mg_sum, cntr;
double m_sum;

void read_input(void);
void solve(void);
bool is_in_plyg(void);
bool is_contain(const Bow &, const Point &);

inline double cross(Vector u, Vector v) { return imag(conj(u) * v); }

inline bool fle(double a, double b) { return a < b + kEps; }
inline bool flt(double a, double b) { return a + kEps < b; }

inline int find_quad(Point p) {
  if (flt(imag(p), 0))
    return flt(real(p), 0) ? 2 : 3;
  else
    return flt(real(p), 0) ? 1 : 0;
}

int main() {
  cout.setf(ios::fixed), cout.precision(4);
  while (cin >> str && str != "end") {
    read_input();
    solve();
  }

  return 0;
}

void read_input(void) {
  int x0, y0, xp, yp, xc, yc, r;

  v_pt.clear(), v_arc.clear();

  cin >> x0 >> y0, xp = x0, yp = y0, v_pt.push_back(Point(x0, y0));
  while (cin >> str && str != "close") {
    if (str == "line")
      cin >> xc >> yc;
    else {
      cin >> xc >> yc >> r;
      v_arc.push_back(Arc(Point(xp, yp), Point(xc, yc), r));
    }
    xp = xc, yp = yc;
    v_pt.push_back(Point(xc, yc));
  }
  if (xc != x0 || yc != y0)
    v_pt.push_back(v_pt[0]);

}

void solve(void) {
  mg_sum = Point(0, 0), m_sum = 0, v_bow.clear();

  for (int i = 0; i < v_pt.size() - 1; ++i) {
    double m;
    Point &p1 = v_pt[i], &p2 = v_pt[i + 1], g;
    m = cross(p1, p2) / 2, g = (p1 + p2) / 3.0;
    mg_sum += m * g, m_sum += m;
  }

  for (int i = 0; i < v_arc.size(); ++i) {
    double c, tht, r;
    Point &p1 = v_arc[i].p1, &p2 = v_arc[i].p2, po, g;

    r = v_arc[i].r;
    c = abs(p2 - p1), tht = acos((2 * r * r - c * c) / (2 * r * r));

    double alph = (kPi - tht) / 2 * (r < 0 ? 1 : -1);
    Vector rtv = Vector(cos(alph), sin(alph)), u = p2 - p1;

    po = p1 + u * rtv * abs(r) / c;

    double a = r * r * (tht - sin(tht)) / 2, dy;

    dy = 2 * pow(abs(r), 3.0) * pow(sin(tht / 2), 3.0) / (3.0 * a);
    tht = kPi * (r < 0 ? -1 : 1) / 2;
    g = po + u * Vector(cos(tht), sin(tht)) / abs(u) * dy;
    a *= (r < 0 ? 1 : -1);

    mg_sum += a * g, m_sum += a;
    v_bow.push_back(Bow(p1, p2, po, r, alph));
  }

  cntr = mg_sum / m_sum;
  cout << real(cntr) + kEps << " " << imag(cntr) + kEps << " ";

  bool res = is_in_plyg();

  if (res) {
    for (int i = 0; i < v_bow.size() && res; ++i)
      if (v_bow[i].r > 0 && is_contain(v_bow[i], cntr))
        res = false;
  }
  else {
    for (int i = 0; i < v_bow.size() && !res; ++i)
      if (v_bow[i].r < 0 && is_contain(v_bow[i], cntr))
        res = true;
  }

  cout << (res ? "+" : "-") << "\n";
}

bool is_in_plyg(void) {
  vector< Point > tmp = v_pt;
  int cnt = 0;

  for (int i = 0; i < tmp.size(); ++i)
    tmp[i] -= cntr;

  for (int i = 0; i < tmp.size() - 1; ++i) {
    Point &p1 = tmp[i], &p2 = tmp[i + 1];
    int qa = find_quad(p1), qb = find_quad(p2);

    if ((qa + 1) % 4 == qb)
      ++cnt;
    else if ((qa + 3) % 4 == qb)
      --cnt;
    else if ((qa + 2) % 4 == qb) {
      if (fle(0, cross(p1, p2)))
        cnt += 2;
      else
        cnt -= 2;
    }
  }

  return cnt != 0;
}

bool is_contain(const Bow &rb, const Point &rp) {
  Point p1, p2, po;
  double r, alph, crs1, crs2, d, dp;

  p1 = rb.p1, p2 = rb.p2, po = rb.po, r = rb.r, alph = rb.alph;
  crs1 = cross(p1 - po, rp - po), crs2 = cross(rp - po, p2 - po);
  d = abs(r) * sin(abs(alph)), dp = abs(rp - po);

  return flt(crs1 * r, 0) && flt(crs2 * r, 0) && fle(d, dp) && fle(dp, abs(r));
}