/*
  x2i = (cos t) x1i - (sin t) y1i + a
  y2i = (sin t) x1i + (cos t) y1i + b
*/

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[2][2] X, Y;

void main() {
  try {
    for (; ; ) {
      XA = readReal();
      YA = readReal();
      TA = readReal();
      foreach (i; 0 .. 2) foreach (j; 0 .. 2) {
        X[i][j] = readReal();
        Y[i][j] = readReal();
      }
      
      real[2] ts;
      foreach (i; 0 .. 2) {
        ts[i] = atan2(Y[i][1] - Y[i][0], X[i][1] - X[i][0]);
      }
      const t = ts[1] - ts[0];
      const a = X[1][0] - (cos(t) * X[0][0] - sin(t) * Y[0][0]);
      const b = Y[1][0] - (sin(t) * X[0][0] + cos(t) * Y[0][0]);
      const ansX = XA - a;
      const ansY = YA - b;
      const ansT = TA - t / PI * 180.0;
      writefln("%.10f %.10f %.10f", ansX, ansY, ansT);
    }
  } catch (EOFException e) {
  }
}