/* v1j = vb + rot(tb) wj v2j = va + rot(ta) wj v11 - v11 = rot(tb) (w1 - w0) v22 - v21 = rot(ta) (w1 - w0) */ import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } real XA, YA, TA; real[3][3] X, Y; void main() { try { for (; ; ) { XA = readReal(); YA = readReal(); TA = readReal() / 180.0 * PI; foreach (i; [1, 2]) foreach (j; [1, 2]) { X[i][j] = readReal(); Y[i][j] = readReal(); } const dv1x = X[1][2] - X[1][1]; const dv1y = Y[1][2] - Y[1][1]; const dv2x = X[2][2] - X[2][1]; const dv2y = Y[2][2] - Y[2][1]; const w2x = cos(-TA) * dv2x - sin(-TA) * dv2y; const w2y = sin(-TA) * dv2x + cos(-TA) * dv2y; const tb = atan2(dv1y, dv1x) - atan2(w2y, w2x); // wj = rot(-ta) (v2j - va) const w1x = cos(-TA) * (X[2][1] - XA) - sin(-TA) * (Y[2][1] - YA); const w1y = sin(-TA) * (X[2][1] - XA) + cos(-TA) * (Y[2][1] - YA); const vbx = X[1][1] - (cos(tb) * w1x - sin(tb) * w1y); const vby = Y[1][1] - (sin(tb) * w1x + cos(tb) * w1y); writefln("%.10f %.10f %.10f", vbx, vby, tb / PI * 180.0); } } catch (EOFException e) { } }