#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 ans[3];
int main()
{
  ll A,B,C;
  cin >> A >> B >> C;
  for(ll x = -1000006; x < 1000006; x++) {
    if((__int128_t)x*x*x+(__int128_t)A*x*x+(__int128_t)B*x+C==0) {
      ans[0] = x;
      break;
    }
  }
  long double a = A+ans[0];
  long double b = -C/ans[0];
  long double D = max(0.0l, a * a - 4 * b);
  long double x1 = (- a - sqrt(D))/2;
  long double x2 = (- a + sqrt(D))/2;
  ans[1] = ll(round(x1));
  ans[2] = ll(round(x2));
  sort(ans, ans + 3);
  printf("%lld %lld %lld\n",ans[0],ans[1],ans[2]);
  return 0;
}