#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
ll A,B,C;
ll f(ll x) {
  return x*x*x+A*x*x+B*x+C;
}

int main()
{
  cin >> A >> B >> C;
  ll ans[3];
  for(ll x = 0; x < 1000006; x++) {
    if(f(x)==0) {ans[0] = x;break;}
    if(f(-x)==0) {ans[0] = -x;break;}
  }
  ll a = A + ans[0];
  ll b = ans[0] != 0 ? -C/ans[0] : B;
  ans[1] = (-a-sqrt(a*a-4*b))/2;
  ans[2] = (-a+sqrt(a*a-4*b))/2;
  sort(ans, ans + 3);
  printf("%lld %lld %lld\n",ans[0],ans[1],ans[2]);
  return 0;
}