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)); }


enum LIM = 3 * 10L^^9;

long A, B, C;

bool check(long x) {
  BigInt xx = x;
  return (xx^^3 + A * xx^^2 + B * xx + C == 0);
}

long[] solve(long a, long b) {
  long delta = a^^2 - 4 * b;
  assert(delta >= 0);
  long lo = -1, hi = LIM;
  for (; lo + 1 < hi; ) {
    const mid = (lo + hi) / 2;
    (mid^^2 >= delta) ? (hi = mid) : (lo = mid);
  }
  assert(hi^^2 == delta);
  assert((a - hi) % 2 == 0);
  return [(a - hi) / 2, (a + hi) / 2];
}

void main() {
  try {
    for (; ; ) {
      A = readLong();
      B = readLong();
      C = readLong();
      
      long[] ans;
      for (long d = 0; ; ++d) {
        if (d == 0 || C % d == 0) {
          foreach (x; [+d, -d]) {
            if (check(x)) {
              ans ~= x;
              ans ~= solve(-A - x, B - x * (-A - x));
              goto found;
            }
          }
        }
      }
     found:
      ans.sort;
      writeln(ans[0], " ", ans[1], " ", ans[2]);
    }
  } catch (EOFException e) {
  }
}